Iterability for (transfinite) stacks

DOI10.1142/S0219061321500082OpenAlexW3082247464MaRDI QIDQ5156473

Farmer Schlutzenberg

Publication date: 18 October 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03880

zbMATH Keywords

inner modelcondensationnormalizationiterabilitylarge cardinalstackmouseiteration strategyiteration tree

Mathematics Subject Classification ID

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

Related Items (2)

The comparison lemma ⋮ The definability of \(\mathbb{E}\) in self-iterable mice

Cites Work

• Unnamed Item
• Unnamed Item
• A long pseudo-comparison of premice in \(L[x\)]
• Combinatorial principles in the core model for one Woodin cardinal
• A premouse inheriting strong cardinals from \(V\)
• Hod mice and the Mouse Set Conjecture
• An Outline of Inner Model Theory
• The self-iterability of L[E]
• VARSOVIAN MODELS I
• Core models with more Woodin cardinals
• Fine structure for tame inner models
• Homogeneously Suslin sets in tame mice
• A weak Dodd-Jensen lemma
• Inner models and large cardinals

This page was built for publication: Iterability for (transfinite) stacks