Determinacy in third order arithmetic
DOI10.1016/J.APAL.2017.05.004zbMATH Open1422.03128OpenAlexW2621190079MaRDI QIDQ2404651FDOQ2404651
Authors: Sherwood Hachtman
Publication date: 19 September 2017
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2017.05.004
Recommendations
- The limits of determinacy in second-order arithmetic
- Determinacy separations for class games
- Δ3O-determinacy, comprehension and induction
- The limits of determinacy in second order arithmetic: consistency and complexity strength
- Weak systems of determinacy and arithmetical quasi-inductive definitions
Foundations of classical theories (including reverse mathematics) (03B30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Second- and higher-order arithmetic and fragments (03F35) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)
Cites Work
- Subsystems of second order arithmetic
- Set Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Higher set theory and mathematical practice
- Title not available (Why is that?)
- 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. II \((\Sigma ^ 0_ 2\) games)
- TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
Cited In (5)
This page was built for publication: Determinacy in third order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404651)