Papers
Topics
Authors
Recent
2000 character limit reached

HOD in inner models with Woodin cardinals

Published 20 Apr 2020 in math.LO | (2004.09201v2)

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\'evy collapse up to its bottom inaccessible cardinal. We prove that assuming $\boldsymbol\Pi1_{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}$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.