Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
Abstract
We prove the following result which is due to the third author. Let n≥1n≥1. 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 n≥1n≥1, namely the statement that Π1n+1Π1n+1 determinacy implies ⅁(n)(<ω2−Π11) determinacy.