Determinacy in third order arithmetic
From MaRDI portal
Publication:2404651
DOI10.1016/j.apal.2017.05.004zbMath1422.03128OpenAlexW2621190079MaRDI QIDQ2404651
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
Inner models, including constructibility, ordinal definability, and core models (03E45) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Determinacy principles (03E60)
Related Items (4)
Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives ⋮ Deflationism beyond arithmetic ⋮ Determinacy separations for class games ⋮ The strength of compactness in computability theory and nonstandard analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
- Weak systems of determinacy and arithmetical quasi-inductive definitions
- The limits of determinacy in second-order arithmetic
- TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS
- Set Theory
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
- Higher set theory and mathematical practice
This page was built for publication: Determinacy in third order arithmetic