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$.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

Global square sequences in extender models.Martin Zeman - 2010 - Annals of Pure and Applied Logic 161 (7):956-985.
More fine structural global square sequences.Martin Zeman - 2009 - Archive for Mathematical Logic 48 (8):825-835.
The long extender algebra.Ralf Schindler - 2018 - Archive for Mathematical Logic 57 (1-2):73-82.
On the extender algebra being complete.Richard Ketchersid & Stuart Zoble - 2006 - Mathematical Logic Quarterly 52 (6):531-533.
Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Suitable extender models II: Beyond ω-huge.W. Hugh Woodin - 2011 - Journal of Mathematical Logic 11 (2):115-436.
The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.
Successor levels of the Jensen hierarchy.Gunter Fuchs - 2009 - Mathematical Logic Quarterly 55 (1):4-20.
Coherent sequences versus Radin sequences.James Cummings - 1994 - Annals of Pure and Applied Logic 70 (3):223-241.

Analytics

Added to PP
2024-04-16

Downloads
1 (#1,904,823)

6 months
1 (#1,478,781)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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.
A premouse inheriting strong cardinals from V.Farmer Schlutzenberg - 2020 - Annals of Pure and Applied Logic 171 (9):102826.

View all 7 references / Add more references