Variations on $\Delta^1_1$ Determinacy and $\aleph_{\omega_1}$
Ramez L. Sami

TL;DR
The paper explores a weaker form of $ ext{Delta}^1_1$ Turing determinacy, showing it implies the existence of models with various infinite cardinals and connecting it to classical determinacy results.
Contribution
It introduces a weaker determinacy principle and demonstrates its implications for the existence of models with infinite cardinals, improving known results on Borel determinacy.
Findings
Weak-Turing-Det}_ ho ( ext{Delta}^1_1)$ implies models with all $ ext{aleph}_ u$ for $ u< ext{omega}_1^{ ext{CK}}$
If every cofinal $ ext{Delta}^1_1$ set contains a degree and its jump, then models with all $ ext{aleph}_ u$ exist
Weak-Turing-Det}_ ho ( ext{Delta}^1_1)$ implies $ ext{Delta}^1_1$ determinacy
Abstract
We consider a seemingly weaker form of Turing determinacy. Let , is the statement: Every set of reals cofinal in the Turing degrees contains two Turing distinct, -equivalent reals. We show in : implies: for every there is a transitive model: . As a corollary: If every cofinal set of Turing degrees contains both a degree and its jump, then for every , there is a transitive model: . -- With a simple proof, this improves upon a well-known result of Harvey Friedman on the strength of Borel determinacy (though not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
