Hostname: page-component-77f85d65b8-8wtlm Total loading time: 0 Render date: 2026-03-27T12:41:01.261Z Has data issue: false hasContentIssue false

$\operatorname {HOD}$ IN INNER MODELS WITH WOODIN CARDINALS

Part of: Set theory

Published online by Cambridge University Press:  13 August 2021

SANDRA MÜLLER
Affiliation:
INSTITUT FÜR MATHEMATIK UNIVERSITÄT WIEN, KOLINGASSE 14-16 1090 WIEN, AUSTRIA E-mail: mueller.sandra@univie.ac.at
GRIGOR SARGSYAN
Affiliation:
DEPARTMENT OF MATHEMATICS RUTGERS UNIVERSITY, HILL CENTER FOR THE MATHEMATICAL SCIENCES 110 FRELINGHUYSEN RD., PISACATAWAY, NJ 08854, USA E-mail: grigor@math.rutgers.edu
Rights & Permissions [Opens in a new window]

Abstract

We analyze the hereditarily ordinal definable sets $\operatorname {HOD} $ in $M_n(x)[g]$ for a Turing cone of reals x, where $M_n(x)$ is the canonical inner model with n Woodin cardinals build over x and g is generic over $M_n(x)$ for the Lévy collapse up to its bottom inaccessible cardinal. We prove that assuming $\boldsymbol \Pi ^1_{n+2}$-determinacy, for a Turing cone of reals x, $\operatorname {HOD} ^{M_n(x)[g]} = M_n(\mathcal {M}_{\infty } | \kappa _{\infty }, \Lambda ),$ where $\mathcal {M}_{\infty }$ is a direct limit of iterates of $M_{n+1}$, $\delta _{\infty }$ is the least Woodin cardinal in $\mathcal {M}_{\infty }$, $\kappa _{\infty }$ is the least inaccessible cardinal in $\mathcal {M}_{\infty }$ above $\delta _{\infty }$, and $\Lambda $ is a partial iteration strategy for $\mathcal {M}_{\infty }$. It will also be shown that under the same hypothesis $\operatorname {HOD}^{M_n(x)[g]} $ satisfies $\operatorname {GCH} $.

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), 2021. Published by Cambridge University Press on behalf of Association for Symbolic Logic