Infinite games and transfinite recursion of multiple inductive definitions
From MaRDI portal
Publication:2904432
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
Cited in
(13)- Weak determinacy and iterations of inductive definitions
- Infinite Games, Inductive Definitions and Transfinite Recursion
- Nondeterminacy and recursion via stacks and games
- scientific article; zbMATH DE number 4039871 (Why is no real title available?)
- 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
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)