# Talk: Canonical inner models and their HODs

On Dec 1st, 2017, at 10:00am I will give a talk in the CUNY Set Theory Seminar.

Abstract: An essential question regarding the theory of inner models is the analysis of the class of all hereditarily ordinal definable sets $\operatorname{HOD}$ inside various inner models $M$ of the set theoretic universe $V$ under appropriate determinacy hypotheses. Examples for such inner models $M$ are $L(\mathbb{R})$, $L[x]$ and $M_n(x)$. Woodin showed that under determinacy hypotheses these models of the form $\operatorname{HOD}^M$ contain large cardinals, which motivates the question whether they are fine-structural as for example the models $L(\mathbb{R})$, $L[x]$ and $M_n(x)$ are. A positive answer to this question would yield that they are models of $\operatorname{CH}, \Diamond$, and other combinatorial principles.

The first model which was analyzed in this sense was $\operatorname{HOD}^{L(\mathbb{R})}$ under the assumption that every set of reals in $L(\mathbb{R})$ is determined. In the 1990’s Steel and Woodin were able to show that $\operatorname{HOD}^{L(\mathbb{R})} = L[M_\infty, \Lambda]$, where $M_\infty$ is a direct limit of iterates of the canonical mouse $M_\omega$ and $\Lambda$ is a partial iteration strategy for $M_\infty$. Moreover Woodin obtained a similar result for the model $\operatorname{HOD}^{L[x,G]}$ assuming $\Delta^1_2$ determinacy, where $x$ is a real of sufficiently high Turing degree, $G$ is $\operatorname{Col}(\omega, {<}\kappa_x)$-generic over $L[x]$ and $\kappa_x$ is the least inaccessible cardinal in $L[x]$.

In this talk I will give an overview of these results (including some background on inner model theory) and outline how they can be extended to the model $\operatorname{HOD}^{M_n(x,g)}$ assuming $\boldsymbol\Pi^1_{n+2}$ determinacy, where $x$ again is a real of sufficiently high Turing degree, $g$ is $\operatorname{Col}(\omega, {<}\kappa_x)$-generic over $M_n(x)$ and $\kappa_x$ is the least inaccessible cardinal in $M_n(x)$.

This is joint work with Grigor Sargsyan.

# Graduation from the University of Münster

Last week I defended my PhD thesis and finally graduated from the University of Münster.
Many thanks to everybody who was there to celebrate with me and especially to Anna, Dorothea, Fabiana and Svenja for the amazing graduation hat.

# Talk at the 1st IRVINE CONFERENCE on DESCRIPTIVE INNER MODEL THEORY and HOD MICE

On July 19th and 21st I gave talks at the 1st IRVINE CONFERENCE on DESCRIPTIVE INNER MODEL THEORY and HOD MICE.

Producing $M_n^\#(x)$ from optimal determinacy hypotheses.

Abstract: In this talk we will outline a proof of Woodin’s result that boldface $\boldsymbol\Sigma^1_{n+1}$ determinacy yields the existence and $\omega_1$-iterability of the premouse $M_n^\#(x)$ for all reals $x$. This involves first generalizing a result of Kechris and Solovay concerning OD determinacy in $L[x]$ for a cone of reals $x$ to the context of mice with finitely many Woodin cardinals. We will focus on using this result to prove the existence and $\omega_1$-iterability of $M_n^\#$ from a suitable hypothesis. Note that this argument is different for the even and odd levels of the projective hierarchy. This is joint work with Ralf Schindler and W. Hugh Woodin.

You can find notes taken by Martin Zeman here and here.

More pictures and notes for the other talks can be found on the conference webpage.

# Talk at the YSTW 2016 in Kopenhagen

From 13th to 17th June 2016 the Young Set Theory Workshop will be held in Kopenhagen. For more information see the webpage of the YSTW 2016. The title of my talk will be the following:

A Journey Through the World of Mice and Games – Projective and Beyond.

Abstract: This talk will be an introduction to inner model theory the at the
level of the projective hierarchy and the $L(\mathbb{R})$-hierarchy. It will
focus on results connecting inner model theory to the determinacy of
certain games.

Mice are sufficiently iterable models of set theory. Martin and Steel
showed in 1989 that the existence of finitely many Woodin cardinals
with a measurable cardinal above them implies that projective
determinacy holds. Neeman and Woodin proved a level-by-level
connection between mice and projective determinacy. They showed that
boldface $\boldsymbol\Pi^1_{n+1}$ determinacy is equivalent to the fact that the
mouse $M_n^\#(x)$ exists and is $\omega_1$-iterable for all reals $x$.

Following this, we will consider pointclasses in the $L(\mathbb{R})$-hierarchy
and show that determinacy for them implies the existence and
$\omega_1$-iterability of certain hybrid mice with finitely many
Woodin cardinals, which we call $M_k^{\Sigma, \#}$. These hybrid mice
are like ordinary mice, but equipped with an iteration strategy for a
mouse they are containing, which enables them to capture certain sets
of reals. We will discuss what it means for a mouse to capture a set
of reals and outline why hybrid mice fulfill this task.

Slides.

# Talk in the KGRC Research Seminar

On June 9th 2016 I gave a talk in the KGRC Research Seminar in Vienna.

Hybrid Mice and Determinacy in the $L(\mathbb{R})$-hierarchy.

Abstract: This talk will be an introduction to inner model theory the at the
level of the $L(\mathbb{R})$-hierarchy. It will
focus on results connecting inner model theory to the determinacy of
certain games.

Mice are sufficiently iterable models of set theory. Martin and Steel
showed in 1989 that the existence of finitely many Woodin cardinals
with a measurable cardinal above them implies that projective
determinacy holds. Neeman and Woodin proved a level-by-level
connection between mice and projective determinacy. They showed that
boldface $\boldsymbol\Pi^1_{n+1}$ determinacy is equivalent to the fact that the
mouse $M_n^\#(x)$ exists and is $\omega_1$-iterable for all reals $x$.

Following this, we will consider pointclasses in the $L(\mathbb{R})$-hierarchy
and show that determinacy for them implies the existence and
$\omega_1$-iterability of certain hybrid mice with finitely many
Woodin cardinals, which we call $M_k^{\Sigma, \#}$. These hybrid mice
are like ordinary mice, but equipped with an iteration strategy for a
mouse they are containing, which enables them to capture certain sets
of reals. We will discuss what it means for a mouse to capture a set
of reals and outline why hybrid mice fulfill this task. If time allows we will sketch a proof that determinacy for sets of reals in the $L(\mathbb{R})$-hierarchy implies the existence of hybrid mice.

Many thanks to Richard for the pictures!