Complete Determinacy and Subsystems of Second Order Arithmetic
From MaRDI portal
Publication:3507462
DOI10.1007/978-3-540-69407-6_49zbMath1142.03370OpenAlexW123450639MaRDI QIDQ3507462
Publication date: 19 June 2008
Published in: Logic and Theory of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_49
Games involving topology, set theory, or logic (91A44) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)
Related Items
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
Cites Work
- 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
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Infinite games in the Cantor space and subsystems of second order arithmetic
- Δ3O-determinacy, comprehension and induction
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
This page was built for publication: Complete Determinacy and Subsystems of Second Order Arithmetic