Full normalization for transfinite stacks

MaRDI QIDQ6504356arXivFDO

Authors Farmer Schlutzenberg

Mathematics Subject Classification ID

Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Abstract: We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $Omega$ and an $(m,Omega+1)$-iteration strategy $Sigma$ for a premouse $M$, such that $Sigma$ and $M$ both have appropriate condensation properties, we extend $Sigma$ to a strategy $Sigm{a}^{\ast }$ for the $(m,Omega,Omega+1{)}^{\ast }$-iteration game such that for all $lambda<Omega$ and all stacks $vecmathcalT=left<mathcal{T}_{a}lphaight{>}_{alpha<lambda}$ via $Sigm{a}^{\ast }$, consisting of normal trees $mathcal{T}_{a}lpha$, each of length $<Omega$, there is a corresponding normal tree $mathcalX$ via $Sigma$ with $M_i^{vecmathcalT}nfty=M_i^{mathcalX}nfty$, along with agreement of iteration maps, when there are no drops in model or degree on main branches. The construction is the result of a combination of work of John Steel and of the author. We also establish some further useful properties of $Sigm{a}^{\ast }$, and use the methods to analyze the comparison of multiple iterates via a common such strategy.

This page was built for publication: Full normalization for transfinite stacks

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