Infinite games and transfinite recursion of multiple inductive definitions
DOI10.1007/978-3-642-30870-3_38zbMATH Open1358.03025OpenAlexW1809562114MaRDI QIDQ2904432FDOQ2904432
Authors: Keisuke Yoshii, Kazuyuki Tanaka 
Publication date: 14 August 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_38
Recommendations
- Weak determinacy and iterations of inductive definitions
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
- Infinite games in the Cantor space and subsystems of second order arithmetic
- The determinacy strength of \(\Pi_2^1\)-comprehension
2-person games (91A05) Games involving topology, set theory, or logic (91A44) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)
Cited In (13)
- Title not available (Why is that?)
- Nondeterminacy and recursion via stacks and games
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
- Complete Determinacy and Subsystems of Second Order Arithmetic
- Determinacy and monotone inductive definitions
- Infinite games in the Cantor space and subsystems of second order arithmetic
- A note on multiple inductive definitions
- Weak and strong versions of effective transfinite recursion
- Transfinite recursion in higher reverse mathematics
- The Extent of Constructive Game Labellings
- Comparing inductive and circular definitions: Parameters, complexity and games
- Infinite Games, Inductive Definitions and Transfinite Recursion
- Weak determinacy and iterations of inductive definitions
This page was built for publication: Infinite games and transfinite recursion of multiple inductive definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904432)
