Δ3O-determinacy, comprehension and induction

DOI10.2178/jsl/1185803618zbMath1118.03056OpenAlexW2010390468MaRDI QIDQ5294020

Kazuyuki Tanaka, Medyahya Ould Medsalem

Publication date: 9 July 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1185803618

zbMATH Keywords

reverse mathematicsdeterminacy

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)

Related Items (8)

Reverse Mathematics: The Playground of Logic ⋮ Open Questions in Reverse Mathematics ⋮ Open determinacy for class games ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ Complete Determinacy and Subsystems of Second Order Arithmetic ⋮ The determinacy strength of \(\Pi_2^1\)-comprehension ⋮ Games for Truth ⋮ The strength of compactness in computability theory and nonstandard analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Bar induction and \(\omega\) model reflection
• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Higher set theory and mathematical practice

This page was built for publication: Δ₃^O-determinacy, comprehension and induction