Polynomial games and determinacy

DOI10.1016/0168-0072(95)00043-7zbMath0858.90139OpenAlexW2029797201MaRDI QIDQ1919550

Tomoyuki Yamakami

Publication date: 23 July 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00043-7

zbMATH Keywords

Turing machineszero-sum gameextensive-form gamepolynomial gameresource-bounded determinacytwo-player games with incomplete information

Mathematics Subject Classification ID

2-person games (91A05) Games involving topology, set theory, or logic (91A44) Turing machines and related notions (03D10) Determinacy principles (03E60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Complexity for type-2 relations
• Descriptive set theory
• Feasible computability and resource bounded topology
• Generic separations
• P-uniform circuit complexity
• Category and Measure in Complexity Classes
• A Proof of Projective Determinacy
• Structural properties for feasibly computable classes of type two
• The axiom of determinateness and reduction principles in the analytical hierarchy
• INFINITE GAMES AND ANALYTIC SETS