Weak axioms of determinacy and subsystems of analysis. II ( ^ 0_ 2 games)

DOI10.1016/0168-0072(91)90045-NMaRDI QIDQ805613zbMATH OpenOpenAlexWikidataFDO

Authors Kazuyuki Tanaka

Publication date 1991

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(91)90045-n

zbMATH Keywords

calibration subsystems of second-order arithmeticmonotone inductive definitionProof-theoretic strength of \(\Sigma ^ 0_ 2\)-determinacytwo-player infinite game

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Determinacy principles (03E60) Second- and higher-order arithmetic and fragments (03F35) 2-person games (91A05)

Recommendations

• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Infinite games in the Cantor space and subsystems of second order arithmetic
• Determinacy and monotone inductive definitions
• Infinite games and transfinite recursion of multiple inductive definitions
• The limits of determinacy in second-order arithmetic

Cites work

• Descriptive set theory
• Fixed point theory in weak second-order arithmetic
• scientific article; zbMATH DE number 3825795 (Why is no real title available?)
• scientific article; zbMATH DE number 3924748 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• The Galvin-Prikry theorem and set existence axioms

Cited in

(25)

• Borel quasi-orderings in subsystems of second-order arithmetic
• Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
• A characterization of \(\Sigma_1^1\)-reflecting ordinals
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• Determinacy in third order arithmetic
• Determinacy and monotone inductive definitions
• Infinite games and transfinite recursion of multiple inductive definitions
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• Reverse mathematics: the playground of logic
• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Complete Determinacy and Subsystems of Second Order Arithmetic
• Determinacy in second order arithmetic
• Determinacy of Wadge classes and subsystems of second order arithmetic
• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• GAMES AND INDUCTION ON REALS
• Parallel feedback Turing computability
• Δ₃^O-determinacy, comprehension and induction
• Open determinacy for class games
• GAMES AND REFLECTION IN
• Locally hyperarithmetical induction
• Lipschitz and Wadge binary games in second order arithmetic
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Determinacy on the edge of second-order arithmetic. I
• The metamathematics of separated determinacy
• Comparing inductive and circular definitions: Parameters, complexity and games

This page was built for publication: Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805613)