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

DOI10.1002/malq.19900360602zbMath0729.03032OpenAlexW2161141713WikidataQ114696420 ScholiaQ114696420MaRDI QIDQ3353013

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

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

Mathematics Subject Classification ID

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

Related Items

Reverse Mathematics: The Playground of Logic ⋮ Δ₃^O-determinacy, comprehension and induction ⋮ Determinacy and monotone inductive definitions ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Determinacy of refinements to the difference hierarchy of co-analytic sets ⋮ Reverse mathematics and initial intervals ⋮ 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 ⋮ Complete Determinacy and Subsystems of Second Order Arithmetic ⋮ A characterization of \(\Sigma_1^1\)-reflecting ordinals ⋮ Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives ⋮ Determinacy of Wadge classes and subsystems of second order arithmetic ⋮ Long Borel games ⋮ A Lipschitz determinacy principle equivalent to weak König lemma