Open determinacy for class games
From MaRDI portal
Publication:5351852
DOI10.1090/conm/690/13865zbMath1423.03200arXiv1509.01099OpenAlexW1779814238MaRDI QIDQ5351852
Joel David Hamkins, Victoria Gitman
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
Axiomatics of classical set theory and its fragments (03E30) Models of arithmetic and set theory (03C62) Determinacy principles (03E60)
Related Items (8)
Inner mantles and iterated HOD ⋮ VARIETIES OF CLASS-THEORETIC POTENTIALISM ⋮ Kelley–Morse set theory does not prove the class Fodor principle ⋮ Set-theoretic blockchains ⋮ Determinacy separations for class games ⋮ UNIVERSISM AND EXTENSIONS OF V ⋮ THE EXACT STRENGTH OF THE CLASS FORCING THEOREM ⋮ Boolean-valued class forcing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classes and truths in set theory
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
- Borel determinacy
- Strongly uplifting cardinals and the boldface resurrection axioms
- Resurrection axioms and uplifting cardinals
- Complexity of winning strategies
- What is the theory without power set?
- RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES
- Weak systems of determinacy and arithmetical quasi-inductive definitions
- The limits of determinacy in second-order arithmetic
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- Absoluteness via resurrection
- Δ3O-determinacy, comprehension and induction
- Transfinite game values in infinite chess
- Higher set theory and mathematical practice
This page was built for publication: Open determinacy for class games