Weak systems of determinacy and arithmetical quasi-inductive definitions

DOI10.2178/jsl/1305810756zbMath1225.03082arXiv0905.4412OpenAlexW2039302704MaRDI QIDQ3011112

No author found.

Publication date: 28 June 2011

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

Full work available at URL: https://arxiv.org/abs/0905.4412

zbMATH Keywords

determinacycomprehensionsubsystems of second-order arithmetic\(\Sigma^0_3\)-gamesarithmetical quasi-inductive definition

Mathematics Subject Classification ID

Applications of game theory (91A80) Second- and higher-order arithmetic and fragments (03F35)

Related Items (18)

Infinite games in the Cantor space and subsystems of second order arithmetic ⋮ Determinacy and monotone inductive definitions ⋮ Determinacy in third order arithmetic ⋮ Determinacy of refinements to the difference hierarchy of co-analytic sets ⋮ ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS ⋮ Open determinacy for class games ⋮ Locally hyperarithmetical induction ⋮ Complete Determinacy and Subsystems of Second Order Arithmetic ⋮ The limits of determinacy in second order arithmetic: consistency and complexity strength ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Guest editors' introduction ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Long Borel games ⋮ A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 ⋮ CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY ⋮ A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS ⋮ GAMES AND INDUCTION ON REALS ⋮ Comparing inductive and circular definitions: Parameters, complexity and games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Notes on naive semantics
• An ordinal analysis of stability
• An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
• A revenge-immune solution to the semantic paradoxes
• Parameter-free uniformisation
• The Length of Infinite Time Turing Machine Computations
• Eventually infinite time Turing machine degrees: infinite time decidable reals

This page was built for publication: Weak systems of determinacy and arithmetical quasi-inductive definitions