The Definability of the Extender Sequence From In

Journal of Symbolic Logic 89 (2):427-459 (2024)
  Copy   BIBTEX

Abstract

Let M be a short extender mouse. We prove that if $E\in M$ and $M\models $ “E is a countably complete short extender whose support is a cardinal $\theta $ and $\mathcal {H}_\theta \subseteq \mathrm {Ult}(V,E)$ ”, then E is in the extender sequence $\mathbb {E}^M$ of M. We also prove other related facts, and use them to establish that if $\kappa $ is an uncountable cardinal of M and $\kappa ^{+M}$ exists in M then $(\mathcal {H}_{\kappa ^+})^M$ satisfies the Axiom of Global Choice. We prove that if M satisfies the Power Set Axiom then $\mathbb {E}^M$ is definable over the universe of M from the parameter $X=\mathbb {E}^M\!\upharpoonright \!\aleph _1^M$, and M satisfies “Every set is $\mathrm {OD}_{\{X\}}$ ”. We also prove various local versions of this fact in which M has a largest cardinal, and a version for generic extensions of M. As a consequence, for example, the minimal proper class mouse with a Woodin limit of Woodin cardinals models “ $V=\mathrm {HOD}$ ”. This adapts to many other similar examples. We also describe a simplified approach to Mitchell–Steel fine structure, which does away with the parameters $u_n$.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

In inner models with Woodin cardinals.Sandra Müller & Grigor Sargsyan - 2021 - Journal of Symbolic Logic 86 (3):871-896.
Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
A criterion for the strong cell decomposition property.Somayyeh Tari - 2023 - Archive for Mathematical Logic 62 (7):871-887.
A model with no magic set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.

Analytics

Added to PP
2024-04-16

Downloads
10 (#1,459,644)

6 months
8 (#551,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Combinatorial principles in the core model for one Woodin cardinal.Ernest Schimmerling - 1995 - Annals of Pure and Applied Logic 74 (2):153-201.
Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.
Fine structure for Tame inner models.E. Schimmerling & J. R. Steel - 1996 - Journal of Symbolic Logic 61 (2):621-639.
Dodd parameters and λ-indexing of extenders.Martin Zeman - 2004 - Journal of Mathematical Logic 4 (01):73-108.

View all 7 references / Add more references