Weak axioms of determinacy and subsystems of analysis I: δ20 games

DOI10.1002/MALQ.19900360602MaRDI QIDQ3353013zbMATH OpenOpenAlexWikidataFDO

Authors Kazuyuki Tanaka

Publication date 1990

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19900360602

zbMATH Keywords

Arithmetical Comprehensionbold-face hierarchycalibration subsystems of second-order arithmeticlight-face hierarchyproof-theoretic strength of \(\Delta ^ 0_ 2\)-determinacyset existence axiomsTransfinite Recursiontwo-player infinite games associated to formulas

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. II \((\Sigma ^ 0_ 2\) games)
• scientific article; zbMATH DE number 6767615
• The problem of determinacy of infinite games from an intuitionistic point of view
• Intuitionistic games: determinacy, completeness, and normalization
• An axiomatization of the core for finite and continuum games
• On strong determinacy of countable stochastic games
• Determinateness of certain almost-Borel games
• A Survey of Determinacy of Infinite Games in Second Order Arithmetic
• Determinacy and indeterminacy of games played on complete metric spaces
• GAMES AND INDUCTION ON REALS

Cited in

(28)

• Determinacy of refinements to the difference hierarchy of co-analytic sets
• Long Borel games
• A Lipschitz determinacy principle equivalent to weak König lemma
• A characterization of \(\Sigma_1^1\)-reflecting ordinals
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• 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
• Complete Determinacy and Subsystems of Second Order Arithmetic
• Determinacy of Wadge classes and subsystems of second order arithmetic
• Reverse mathematics and initial intervals
• Complexity of Winning Strategies for Δ 0 2 Games
• The limits of determinacy in second order arithmetic: consistency and complexity strength
• Δ₃^O-determinacy, comprehension and induction
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
• Open determinacy for class games
• Well ordering principles for iterated \(\Pi^1_1\)-comprehension
• Locally hyperarithmetical induction
• Lipschitz and Wadge binary games in second order arithmetic
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Monotone versus non-monotone projective operators
• Determinacy on the edge of second-order arithmetic. I
• On the reverse mathematics of cut-elimination and determinacy
• On inverse Goodstein sequences
• The metamathematics of separated determinacy
• Binary choice games and arithmetical comprehension
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)

This page was built for publication: Weak axioms of determinacy and subsystems of analysis I: δ20 games

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