Weak determinacy and iterations of inductive definitions
From MaRDI portal
Publication:3530407
Recommendations
Cited in
(19)- Complete Determinacy and Subsystems of Second Order Arithmetic
- A characterization of \(\Sigma_1^1\)-reflecting ordinals
- Template iterations with non-definable ccc forcing notions
- A Lipschitz determinacy principle equivalent to weak König lemma
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Open determinacy for class games
- scientific article; zbMATH DE number 1342277 (Why is no real title available?)
- scientific article; zbMATH DE number 2186968 (Why is no real title available?)
- THE WEAK VOPĚNKA PRINCIPLE FOR DEFINABLE CLASSES OF STRUCTURES
- Transfinite recursion in higher reverse mathematics
- Weak systems of determinacy and arithmetical quasi-inductive definitions
- Countably many weakenings of Belnap-Dunn logic
- Determinacy and monotone inductive definitions
- Weak assumption and iterative admissibility
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
- Infinite games and transfinite recursion of multiple inductive definitions
- Infinite games in the Cantor space and subsystems of second order arithmetic
- The determinacy strength of \(\Pi_2^1\)-comprehension
- A note on multiple inductive definitions
This page was built for publication: Weak determinacy and iterations of inductive definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3530407)