Narrow Results

We prove the following result which is due to the third author. Let $n\ge 1$. If ${\mathrm{\Pi }}_n^1$ determinacy and ${\mathrm{\Pi }}_{n+1}^1$ determinacy both hold true and there is no ${\mathrm{\Sigma }}_{n+2}^1$-definable ${\omega }_1$-sequence of pairwise distinct reals, then $M_n^{\#}$ exists and is ${\omega }_1$-iterable. The proof yields that ${\mathrm{\Pi }}_{n+1}^1$ determinacy implies that $M_n^{\#}(x)$ exists and is ${\omega }_1$-iterable for all reals $x$. A consequence is the Determinacy Transfer Theorem for arbitrary $n\ge 1$, namely the statement that ${\mathrm{\Pi }}_{n+1}^1$ determinacy implies ${⅁}^{(n)}(<{\omega }^2-{\mathrm{\Pi }}_1^1)$ determinacy.

We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\mathrm{\Omega }$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\mathrm{\Sigma }$ be an $(m,\mathrm{\Omega }+1)$-iteration strategy for $M$ (roughly, a normal $(\mathrm{\Omega }+1)$-strategy). We define a natural condensation property for iteration strategies, inflation condensation. We show that if $\mathrm{\Sigma }$ has inflation condensation then $M$ is ${(m,\mathrm{\Omega },\mathrm{\Omega }+1)}^{\ast }$-iterable (roughly, $M$ is iterable for length $\le \mathrm{\Omega }$ stacks of normal trees each of length $<\mathrm{\Omega }$), and moreover, we define a specific such strategy ${\mathrm{\Sigma }}^{\mathrm{\text{st}}}$ and a reduction of stacks via ${\mathrm{\Sigma }}^{\mathrm{\text{st}}}$ to normal trees via $\mathrm{\Sigma }$. If $\mathrm{\Sigma }$ has the Dodd-Jensen property and $\mathrm{\text{card}}(M)<\mathrm{\Omega }$ then $\mathrm{\Sigma }$ has inflation condensation. We also apply some of the techniques developed to prove that if $\mathrm{\Sigma }$ has strong hull condensation (introduced independently by John Steel), and $G$ is $V$-generic for an $\mathrm{\Omega }$-cc forcing, then $\mathrm{\Sigma }$ extends to an $(m,\mathrm{\Omega }+1)$-strategy ${\mathrm{\Sigma }}^{+}$ for $M$ with strong hull condensation, in the sense of $V[G]$. Moreover, this extension is unique. We deduce that if $G$ is $V$-generic for a ccc forcing then $V$ and $V[G]$ have the same $\omega$-sound, $(\omega ,\mathrm{\Omega }+1)$-iterable premice which project to $\omega$.

If we replace first-order logic by second-order logic in the original definition of Gödel’s inner model $L$, we obtain the inner model of hereditarily ordinal definable (HOD) sets [33]. In this paper, we consider inner models that arise if we replace first-order logic by a logic that has some, but not all, of the strength of second-order logic. Typical examples are the extensions of first-order logic by generalized quantifiers, such as the Magidor–Malitz quantifier [24], the cofinality quantifier [35], or stationary logic [6]. Our first set of results show that both $L$ and HOD manifest some amount of formalism freeness in the sense that they are not very sensitive to the choice of the underlying logic. Our second set of results shows that the cofinality quantifier gives rise to a new robust inner model between $L$ and HOD. We show, among other things, that assuming a proper class of Woodin cardinals the regular cardinals $>{\aleph }_1$ of $V$ are weakly compact in the inner model arising from the cofinality quantifier and the theory of that model is (set) forcing absolute and independent of the cofinality in question. We do not know whether this model satisfies the Continuum Hypothesis, assuming large cardinals, but we can show, assuming three Woodin cardinals and a measurable above them, that if the construction is relativized to a real, then on a cone of reals, the Continuum Hypothesis is true in the relativized model.