Lower bounds on degrees of game-theoretic structures

DOI10.1016/0165-4896(88)90002-9zbMath0651.90110OpenAlexW2051512972MaRDI QIDQ1106754

Alain A. Lewis

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0165-4896(88)90002-9

zbMATH Keywords

minimal degreesrelational structuresrecursive functionsunsolvabilityTuring degreeInfinite stage Gale-Stewart gamesN- person non-cooperative gamesprioric Banach-Mazur gamesSingle- player choice functionsWalrasian models of general equilibrium

Mathematics Subject Classification ID

Game theory (91A99) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10)

Related Items (2)

A note on degrees of presentation of games as relational structures ⋮ On the independence of core-equivalence results from Zermelo-Fraenkel set theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of unsolvability: structure and theory
• On degrees of recursive unsolvability
• On effectively computable realizations of choice functions
• The minimum degree of recursively representable choice functions
• The recursively enumerable degrees are dense
• Countable retracing functions and \(\Pi_2^0\) predicates
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Complexity of winning strategies
• On the degrees less than 0'
• On degrees of unsolvability
• Degrees of Computability
• Recursive constructions in topological spaces
• Prioric games and minimal degrees below $0^{(1)}$
• On complexity properties of recursively enumerable sets
• Diagonalization in degree constructions
• Computational complexity of recursively enumerable sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Measurable cardinals and analytic games
• Effective operations in a general setting
• Recursive metric spaces
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Equilibrium points in n -person games
• Existence of an Equilibrium for a Competitive Economy
• Recursive Real Numbers

This page was built for publication: Lower bounds on degrees of game-theoretic structures