Open determinacy for class games

DOI10.1090/CONM/690/13865MaRDI QIDQ5351852zbMATH OpenOpenAlexFDO

Authors Victoria Gitman, Joel David Hamkins

Publication date 30 August 2017

Published in Foundations of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.01099

zbMATH Keywords

\(\mathrm {KM}\)\(\mathrm{GBC}\)open determinacy

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Axiomatics of classical set theory and its fragments (03E30) Determinacy principles (03E60)

Abstract: The principle of open determinacy for class games---two-player games of perfect information with plays of length $omega$, where the moves are chosen from a possibly proper class, such as games on the ordinals---is not provable in Zermelo-Fraenkel set theory ZFC or G"odel-Bernays set theory GBC, if these theories are consistent, because provably in ZFC there is a definable open proper class game with no definable winning strategy. In fact, the principle of open determinacy and even merely clopen determinacy for class games implies Con(ZFC) and iterated instances Con(Con(ZFC)) and more, because it implies that there is a satisfaction class for first-order truth and indeed a transfinite tower of truth predicates for iterated truth-about-truth, relative to any class parameter. This is perhaps explained, in light of the Tarskian recursive definition of truth, by the more general fact that the principle of clopen determinacy is exactly equivalent over GBC to the principle of elementary transfinite recursion ETR over well-founded class relations. Meanwhile, the principle of open determinacy for class games is provable in the stronger theory GBC+$P{i}_1^1$-comprehension, a proper fragment of Kelley-Morse set theory KM.

Recommendations

• Determinacy separations for class games
• Determinacy in L(ℝ)
• Determinateness of certain almost-Borel games
• scientific article; zbMATH DE number 4072961
• GAMES OF LENGTH ω₁

Cites work

• Absoluteness via resurrection
• Borel determinacy
• Classes and truths in set theory
• Complexity of winning strategies
• Higher set theory and mathematical practice
• scientific article; zbMATH DE number 3078993 (Why is no real title available?)
• In praise of logic. On Bourbaki and (the lack of) teaching logic
• Relative predicativity and dependent recursion in second-order set theory and higher-order theories
• Resurrection axioms and uplifting cardinals
• Strongly uplifting cardinals and the boldface resurrection axioms
• Subsystems of second order arithmetic
• The limits of determinacy in second-order arithmetic
• Transfinite game values in infinite chess
• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Weak determinacy and iterations of inductive definitions
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• What is the theory ZFC without power set?
• Δ₃^O-determinacy, comprehension and induction

Cited in

(13)

• Set-theoretic blockchains
• Determinacy separations for class games
• scientific article; zbMATH DE number 695617 (Why is no real title available?)
• scientific article; zbMATH DE number 1956506 (Why is no real title available?)
• Universism and extensions of \(V\)
• Boolean-valued class forcing
• Inner mantles and iterated HOD
• Kelley–Morse set theory does not prove the class Fodor principle
• The exact strength of the class forcing theorem
• VARIETIES OF CLASS-THEORETIC POTENTIALISM
• A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
• Reflection in second-order set theory with abundant urelements bi-interprets a supercompact cardinal
• Non-tightness in class theory and second-order arithmetic

This page was built for publication: Open determinacy for class games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351852)