A note on degrees of presentation of games as relational structures

DOI10.1016/0165-4896(90)90061-BzbMath0698.90100MaRDI QIDQ912772

Alain A. Lewis

Publication date: 1990

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

relational structuresTuring degrees of unsolvabilityabstract gamesrecursion-theoretic complexity

Mathematics Subject Classification ID

Cooperative games (91A12) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Lower bounds on degrees of game-theoretic structures
• Reductions on NP and p-selective sets
• Polynomial Time Enumeration Reducibility
• Degrees of Structures

This page was built for publication: A note on degrees of presentation of games as relational structures