Weak axioms of determinacy and subsystems of analysis I: δ20 games
DOI10.1002/MALQ.19900360602zbMATH Open0729.03032OpenAlexW2161141713WikidataQ114696420 ScholiaQ114696420MaRDI QIDQ3353013FDOQ3353013
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
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
set existence axiomscalibration subsystems of second-order arithmeticArithmetical Comprehensionbold-face hierarchylight-face hierarchyproof-theoretic strength of \(\Delta ^ 0_ 2\)-determinacyTransfinite Recursiontwo-player infinite games associated to formulas
2-person games (91A05) Hierarchies of computability and definability (03D55) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)
Cited In (22)
- Open determinacy for class games
- Infinite games and transfinite recursion of multiple inductive definitions
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
- Weak systems of determinacy and arithmetical quasi-inductive definitions
- Reverse mathematics: the playground of logic
- A characterization of \(\Sigma_1^1\)-reflecting ordinals
- Reverse mathematics and initial intervals
- Complete Determinacy and Subsystems of Second Order Arithmetic
- Long Borel games
- Determinacy and monotone inductive definitions
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Δ3O-determinacy, comprehension and induction
- The limits of determinacy in second order arithmetic: consistency and complexity strength
- Determinacy of refinements to the difference hierarchy of co-analytic sets
- The determinacy strength of \(\Pi_2^1\)-comprehension
- Locally hyperarithmetical induction
- Lipschitz and Wadge binary games in second order arithmetic
- Complexity of Winning Strategies for Δ 0 2 Games
- Monotone versus non-monotone projective operators
- A Lipschitz determinacy principle equivalent to weak König lemma
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
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)
