Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 120 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

HOD in inner models with Woodin cardinals (2004.09201v2)

Published 20 Apr 2020 in math.LO

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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