OPTIMAL PROOFS OF DETERMINACY II

From MaRDI portal





This paper is a sequel to Part I [Bull. Symb. Log. 1, 327-339 (1995; Zbl 0835.03017)]. In it, the author provides a complete proof of a lemma that allows proving determinacy from Woodin cardinals. In the earlier article he announced the lemma, and he used it there to prove extensions of theorems of Martin, Steel, and Woodin about determinacy within the projective hierarchy. In this paper the lemma is applied to prove determinacy of sets in \(\Game^{(n)}\) \((<\omega^{2}\)-\(\Pi^{1}_{1})\), \(n\geq 1\). The assumption used to prove this determinacy is optimal in the base theory ZFC + \(\Pi^{1}_{1}\)-determinacy.











This page was built for publication: OPTIMAL PROOFS OF DETERMINACY II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799378)