Full normalization for transfinite stacks

arXiv2102.03359MaRDI QIDQ6504356FDOQ6504356

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

O m e g a

and an

(m, O m e g a + 1)

-iteration strategy

S i g m a

for a premouse

M

, such that

S i g m a

and

M

both have appropriate condensation properties, we extend

S i g m a

to a strategy

S i g m a^{*}

for the

(m, O m e g a, O m e g a + 1)^{*}

-iteration game such that for all

l a m b d a < O m e g a

and all stacks

v e c m a t h c a l T = l e f t < m a t h c a l T_{a} l p h a i g h t >_{a l p h a < l a m b d a}

via

S i g m a^{*}

, consisting of normal trees

m a t h c a l T_{a} l p h a

, each of length

< O m e g a

, there is a corresponding normal tree

m a t h c a l X

via

S i g m a

with

M_{i}^{v e c m a t h c a l T} n f t y = M_{i}^{m a t h c a l X} n f t y

, 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

S i g m a^{*}

, and use the methods to analyze the comparison of multiple iterates via a common such strategy.

Mathematics Subject Classification ID

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

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)