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

zbMATH Keywords

determinacyadmissibilityreverse mathematicshigher-order arithmetic

Mathematics Subject Classification ID

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)

Recommendations

• The limits of determinacy in second-order arithmetic
• Determinacy separations for class games
• Δ₃^O-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

Cites work

• scientific article; zbMATH DE number 4068856 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3993574 (Why is no real title available?)
• scientific article; zbMATH DE number 2236640 (Why is no real title available?)
• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• Higher set theory and mathematical practice
• Set Theory
• Subsystems of second order arithmetic
• The limits of determinacy in second-order arithmetic
• Transfinite recursion in higher reverse mathematics
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Weak systems of determinacy and arithmetical quasi-inductive definitions

Cited in

(5)

• Determinacy separations for class games
• Third-Order Computation and Bounded Arithmetic
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• The strength of compactness in computability theory and nonstandard analysis
• Deflationism beyond arithmetic

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)