Hostname: page-component-76d6cb85b7-lcgwf Total loading time: 0 Render date: 2026-07-14T09:03:18.512Z Has data issue: false hasContentIssue false

THE DEFINABILITY OF THE EXTENDER SEQUENCE $\mathbb {E}$ FROM $\mathbb {E}\upharpoonright \aleph _1$ IN $L[\mathbb {E}]$

Part of: Set theory

Published online by Cambridge University Press:  15 April 2024

FARMER SCHLUTZENBERG*
Affiliation:
INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE TU WIEN WIEDNER HAUPTSTRASSE 8–10/104 1040 VIENNA, AUSTRIA
Rights & Permissions [Opens in a new window]

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

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic