Weak determinacy and iterations of inductive definitions

zbMATH Open1157.03035MaRDI QIDQ3530407FDOQ3530407

Kazuyuki Tanaka, Medyahya Ould Medsalem

Publication date: 20 October 2008

Recommendations

• Δ₃^O-determinacy, comprehension and induction
• Infinite games and transfinite recursion of multiple inductive definitions
• A note on multiple inductive definitions
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Weak systems of determinacy and arithmetical quasi-inductive definitions

zbMATH Keywords

determinacyreverse mathematicsinductive definition

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)

Cited In (15)

• Open determinacy for class games
• Title not available (Why is that?)
• A characterization of \(\Sigma_1^1\)-reflecting ordinals
• Complete Determinacy and Subsystems of Second Order Arithmetic
• Determinacy and monotone inductive definitions
• Weak assumption and iterative admissibility
• Countably many weakenings of Belnap-Dunn logic
• Determinacy of Wadge classes and subsystems of second order arithmetic
• THE WEAK VOPĚNKA PRINCIPLE FOR DEFINABLE CLASSES OF STRUCTURES
• Infinite games in the Cantor space and subsystems of second order arithmetic
• Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Template iterations with non-definable ccc forcing notions
• A Lipschitz determinacy principle equivalent to weak König lemma
• Title not available (Why is that?)

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)