World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Mice with finitely many Woodin cardinals from optimal determinacy hypotheses

    https://doi.org/10.1142/S0219061319500132Cited by:8 (Source: Crossref)

    We prove the following result which is due to the third author. Let n1n1. If Π1nΠ1n determinacy and Π1n+1Π1n+1 determinacy both hold true and there is no Σ1n+2Σ1n+2-definable ω1ω1-sequence of pairwise distinct reals, then M#nM#n exists and is ω1ω1-iterable. The proof yields that Π1n+1Π1n+1 determinacy implies that M#n(x)M#n(x) exists and is ω1ω1-iterable for all reals xx. A consequence is the Determinacy Transfer Theorem for arbitrary n1n1, namely the statement that Π1n+1Π1n+1 determinacy implies (n)(<ω2Π11) determinacy.

    AMSC: 03E45, 03E55, 03E60, 03E35