Abstract
AbstractWe locate winning strategies for various -games in the L-hierarchy in order to prove the following:Theorem 1. KP + Σ2-Comprehension -Determinacy.”Alternatively: “there is a β-model of -Determinacy.” The implication is not reversible. (The antecedent here may be replaced with instances of Comprehension with only -lightface definable parameters—or even weaker theories.)Theorem 2. KP + Δ2-Comprehension + Σ2-Replacement + -Determinacy.(Here AQI is the assertion that every arithmetical quasi-inductive definition converges.) Alternatively: -Determinacy.Hence the theories: , and are in strictly descending order of strength.
Publisher
Cambridge University Press (CUP)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Locally hyperarithmetical induction;Bulletin of the London Mathematical Society;2022-11-29
2. GAMES AND INDUCTION ON REALS;The Journal of Symbolic Logic;2021-09-13
3. Long Borel Games;Israel Journal of Mathematics;2021-06
4. Determinacy and monotone inductive definitions;Israel Journal of Mathematics;2019-03
5. Higher Type Recursion for Transfinite Machine Theory;Computing with Foresight and Industry;2019