Determinacy in third order arithmetic

DOI10.1016/J.APAL.2017.05.004MaRDI QIDQ2404651zbMATH OpenOpenAlexFDO

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

admissibilitydeterminacyhigher-order arithmeticreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60) Second- and higher-order arithmetic and fragments (03F35)

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

• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• Higher set theory and mathematical practice
• 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?)
• 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

(6)

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

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)