We prove the following result which is due to the third author. Let [Formula: see text]. If [Formula: see text] determinacy and [Formula: see text] determinacy both hold true and there is no [Formula: see text]-definable [Formula: see text]-sequence of pairwise distinct reals, then [Formula: see text] exists and is [Formula: see text]-iterable. The proof yields that [Formula: see text] determinacy implies that [Formula: see text] exists and is [Formula: see text]-iterable for all reals [Formula: see text]. A consequence is (...) the Determinacy Transfer Theorem for arbitrary [Formula: see text], namely the statement that [Formula: see text] determinacy implies [Formula: see text] determinacy. (shrink)

We prove the following result which is due to the third author. Let [Formula: see text]. If [Formula: see text] determinacy and [Formula: see text] determinacy both hold true and there is no [Formula: see text]-definable [Formula: see text]-sequence of pairwise distinct reals, then [Formula: see text] exists and is [Formula: see text]-iterable. The proof yields that [Formula: see text] determinacy implies that [Formula: see text] exists and is [Formula: see text]-iterable for all reals [Formula: see text]. A consequence is (...) the Determinacy Transfer Theorem for arbitrary [Formula: see text], namely the statement that [Formula: see text] determinacy implies [Formula: see text] determinacy. (shrink)

The present paper investigates the power of proper forcings to change the shape of the universe, in a certain well-defined respect. It turns out that the ranking among large cardinals can be used as a measure for that power. However, in order to establish the final result I had to isolate a new large cardinal concept, which I dubbed “remarkability.” Let us approach the exact formulation of the problem—and of its solution—at a slow pace.Breathtaking developments in the mid 1980s found (...) one of its culminations in the theorem, due to Martin, Steel, and Woodin, that the existence of infinitely many Woodin cardinals with a measurable cardinal above them all implies that AD, the axiom of determinacy, holds in the least inner model containing all the reals, L. One of the nice things about AD is that the theory ZF + AD + V = L appears as a choiceless “completion” of ZF in that any interesting question seems to find an at least attractive answer in that theory. Beyond that, AD is very canonical as may be illustrated as follows.Let us say that L is absolute for set-sized forcings if for all posets P ∈ V, for all formulae ϕ, and for all ∈ ℝ do we have thatwhere is a name for the set of reals in the extension. (shrink)

We show that either of the following hypotheses imply that there is an inner model with a proper class of strong cardinals and a proper class of Woodin cardinals. 1) There is a countably closed cardinal k ≥ N₃ such that □k and □(k) fail. 2) There is a cardinal k such that k is weakly compact in the generic extension by Col(k, k⁺). Of special interest is 1) with k = N₃ since it follows from PFA by theorems of (...) Todorcevic and Velickovic. Our main new technical result, which is due to the first author, is a weak covering theorem for the model obtained by stacking mice over $K^c ||k.$. (shrink)

We give a direct and elementary proof of the fact that every real-valued probability measure can be approximated—up to an infinitesimal—by a hyperreal-valued one which is regular and defined on the whole powerset of the sample space.

Let L[E] be an iterable tame extender model. We analyze to which extent L[E] knows fragments of its own iteration strategy. Specifically, we prove that inside L[E], for every cardinal K which is not a limit of Woodin cardinals there is some cutpoint t K > a>ω1 are cardinals, then ◊$_{K.\lambda }^* $ holds true, and if in addition λ is regular, then ◊$_{K.\lambda }^* $ holds true.

The main result of this paper is the following theorem: Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M * is a linear iterate of M as in (a), then M * is coarsely iterable with respect to iteration trees which do not use the top extender of M * and its images. Then M is coarsely iterable.

LetZ2,Z3, andZ4denote 2nd, 3rd, and 4thorder arithmetic, respectively. We let Harrington’s Principle, HP, denote the statement that there is a realxsuch that everyx-admissible ordinal is a cardinal inL. The known proofs of Harrington’s theorem “$Det\left$implies 0♯exists” are done in two steps: first show that$Det\left$implies HP, and then show that HP implies 0♯exists. The first step is provable inZ2. In this paper we show thatZ2+ HP is equiconsistent with ZFC and thatZ3+ HP is equiconsistent with ZFC + there exists a remarkable (...) cardinal. As a corollary,Z3+ HP does not imply 0♯exists, whereas Z4+ HP does. We also study strengthenings of Harrington’s Principle over 2ndand 3rdorder arithmetic. (shrink)

If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at N₂ with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC-model. This yields that if Woodin's ℙ max axiom (*) holds, then BPFA implies that V is closed under the "Woodin-in-the-next-ZFC-model" operator. We also discuss stronger Mouse Reflection principles which we show to follow from strengthenings of BPFA, and we discuss the theory BPFA plus "NS ω1 is precipitous" and strengthenings (...) thereof. Along the way, we answer a question of Baumgartner and Taylor. [2, Question 6.11]. (shrink)

Generalizing Woodin’s extender algebra, cf. e.g. Steel Handbook of set theory, Springer, Berlin, 2010), we isolate the long extender algebra as a general version of Bukowský’s forcing, cf. Bukovský, in the presence of a supercompact cardinal.

The current paper proves the results announced in [5]. We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and ω-Erdos cardinals. They are characterized by the existence of "O # -like" embeddings; however, they relativize down to L. It turns out that the existence of a remarkable cardinal is equiconsistent with L(R) absoluteness for proper forcings. In particular, said absoluteness does not imply Π 1 1 determinacy.

We show that L absoluteness for semi-proper forcings is equiconsistent with the existence of a remarkable cardinal, and hence by [6] with L absoluteness for proper forcings. By [7], L absoluteness for stationary set preserving forcings gives an inner model with a strong cardinal. By [3], the Bounded Semi-Proper Forcing Axiom is equiconsistent with the Bounded Proper Forcing Axiom , which in turn is equiconsistent with a reflecting cardinal. We show that Bounded Martin's Maximum is much stronger than BSPFA in (...) that if BMM holds, then for every X ∈ V , X# exists. (shrink)

We introduce 0• as a sharp for an inner model with a proper class of strong cardinals. We prove the existence of the core model K in the theory “ does not exist”. Combined with work of Woodin, Steel, and earlier work of the author, this provides the last step for determining the exact consistency strength of the assumption in the statement of the 12th Delfino problem pp. 221–224)).

It is shown in ZF that if $\delta are such that δ and δ + are either both weakly compact or singular cardinals and Ω is large enough for putting the core model apparatus into action then there is an inner model with a Woodin cardinal.

Let N be a transitive model of ZFC such that ωN ⊂ N and P(R) ⊂ N. Assume that both V and N satisfy "the core model K exists." Then KN is an iterate of K. i.e., there exists an iteration tree J on K such that J has successor length and $\mathit{M}_{\infty}^{\mathit{J}}=K^{N}$. Moreover, if there exists an elementary embedding π: V → N then the iteration map associated to the main branch of J equals π ↾ K. (This answers (...) a question of W. H. Woodin, M. Gitik, and others.) The hypothesis that P(R) ⊂ N is not needed if there does not exist a transitive model of ZFC with infinitely many Woodin cardinals. (shrink)

We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that , the Axiom of Determinacy, holds in the of a generic extension of : every uncountable cardinal is singular, and every infinite successor cardinal is weakly compact and every uncountable limit cardinal is singular.

If ω n has the tree property for all $2 \leq n and $2^{ , then for all X ∈ H ℵ ω and $n exists.

We give an optimal lower bound in terms of large cardinal axioms for the logical strength of projective uniformization in conjuction with other regularity properties of projective sets of real numbers, namely Lebesgue measurability and its dual in the sense of category . Our proof uses a projective computation of the real numbers which code inital segments of a core model and answers a question in Hauser.

We generalize ∇(A), which was introduced in [Sch∞], to larger cardinals. For a regular cardinal κ>ℵ0 we denote by ∇ κ (A) the statement that and for all regular θ>κ, is stationary in It was shown in [Sch∞] that can hold in a set-generic extension of L. We here prove that can hold in a set-generic extension of L as well. In both cases we in fact get equiconsistency theorems. This strengthens results of [Rä00] and [Rä01]. is equivalent with the (...) existence of 0#. (shrink)

If there is no inner model with ω many strong cardinals, then there is a set forcing extension of the universe with a projective well-ordering of the reals.

We construct, assuming that there is no inner model with a Woodin cardinal but without any large cardinal assumption, a model Kc which is iterable for set length iterations, which is universal with respect to all weasels with which it can be compared, and is universal with respect to set sized premice.

We show that if I is a precipitous ideal on ω₁ and if θ > ω₁ is a regular cardinal, then there is a forcing P = P(I, θ) which preserves the stationarity of all I-positive sets such that in $V^P $ , is a generic iterate of a countable structure . This shows that if the nonstationary ideal on ω₁ is precipitous and $H_\theta ^\# $ exists, then there is a stationary set preserving forcing which increases $\delta _2^1 $ (...) · Moreover, if Bounded Martin's Maximum holds and the nonstationary ideal on ω₁ is precipitous, then $\delta _2^1 $ = u₂ = ω₂. (shrink)

Suppose that there is no transitive model of ZFC + there is a strong cardinal, and let K denote the core model. It is shown that if $\delta$ has the tree property then $\delta^{+K} = \delta^+$ and $\delta$ is weakly compact in K.

We introduce and consider the inner-model reflection principle, which asserts that whenever a statement \varphi(a) in the first-order language of set theory is true in the set-theoretic universe V, then it is also true in a proper inner model W \subset A. A stronger principle, the ground-model reflection principle, asserts that any such \varphi(a) true in V is also true in some non-trivial ground model of the universe with respect to set forcing. These principles each express a form of width (...) reflection in contrast to the usual height reflection of the Lévy–Montague reflection theorem. They are each equiconsistent with ZFC and indeed \Pi_2-conservative over ZFC, being forceable by class forcing while preserving any desired rank-initial segment of the universe. Furthermore, the inner-model reflection principle is a consequence of the existence of sufficient large cardinals, and lightface formulations of the reflection principles follow from the maximality principle MP and from the inner-model hypothesis IMH. We also consider some questions concerning the expressibility of the principles. (shrink)

We show that the following conjecture about the universe V of all sets is wrong: for all set-theoretical (i.e., first order) schemata true in V there is a transitive set "reflecting" in such a way that the second order statement corresponding to is true in . More generally, we indicate the ontological commitments of any theory that exploits reflection principles in order to yield large cardinals. The disappointing conclusion will be that our only apparently good arguments for the existence of (...) large cardinals have bad presuppositions. (shrink)

It is shown in ZF that if $\delta < \delta^+ < \Omega$ are such that $\delta$ and $\delta^+$ are either both weakly compact or singular cardinals and $\Omega$ is large enough for putting the core model apparatus into action then there is an inner model with a Woodin cardinal.

We show that the statement “every universally Baire set of reals has the perfect set property” is equiconsistent modulo ZFC with the existence of a cardinal that we call virtually Shelah for supercompactness. These cardinals resemble Shelah cardinals and Shelah-for-supercompactness cardinals but are much weaker: if $0^\sharp $ exists then every Silver indiscernible is VSS in L. We also show that the statement $\operatorname {\mathrm {uB}} = {\boldsymbol {\Delta }}^1_2$, where $\operatorname {\mathrm {uB}}$ is the pointclass of all universally Baire (...) sets of reals, is equiconsistent modulo ZFC with the existence of a $\Sigma _2$ -reflecting VSS cardinal. (shrink)

We generalize results of [3] and [1] to hyperprojective sets of reals, viz. to more than finitely many strong cardinals being involved. We show, for example, that if every set of reals in Lω is weakly homogeneously Souslin, then there is an inner model with an inaccessible limit of strong cardinals.

Let n ≥ 3 be an integer. We show that it is consistent (relative to the consistency of n - 2 strong cardinals) that every $\Sigma_n^1-set$ of reals is universally Baire yet there is a (lightface) projective well-ordering of the reals. The proof uses "David's trick" in the presence of inner models with strong cardinals.

Let 0 < n < ω. If there are n Woodin cardinals and a measurable cardinal above, but $M_{n+1}^{\#}$ doesn't exist, then the core model K exists in a sense made precise. An Iterability Inheritance Hypothesis is isolated which is shown to imply an optimal correctness result for K.

We prove that every homogeneously Souslin set is coanalytic provided that either (a) 0long does not exist, or else (b) V = K, where K is the core model below a μ-measurable cardinal.

Let n ≥ 3 be an integer. We show that it is consistent that every σ1n-set of reals is universally Baire yet there is a projective well-ordering of the reals. The proof uses “David’s trick” in the presence of inner models with strong cardinals.

For ordinals α beginning a Σ1 gap in equation image, where equation image is closed under number quantification, we give an inner model-theoretic proof that every thin equation image equivalence relation is equation image in a real parameter from the hypothesis equation image.

We isolate natural strengthenings of Bounded Martin’s Maximum which we call ${\mathsf{BMM}}^{*}$ and $A-{\mathsf{BMM}}^{*,++}$, and we investigate their consequences. We also show that if $A-{\mathsf{BMM}}^{*,++}$ holds true for every set of reals $A$ in $L$, then Woodin’s axiom $$ holds true. We conjecture that ${\mathsf{MM}}^{++}$ implies $A-{\mathsf{BMM}}^{*,++}$ for every $A$ which is universally Baire.

If $\omega_n$ has the tree property for all $2 \leq n < \omega$ and $2^{<\aleph_{\omega}} = \aleph_{\omega}$, then for all $X \in H_{\aleph_{\omega}}$ and $n < \omega, M^#_n$ exists.

Continuing [7], we here prove that the Chang Conjecture $(\aleph_3,\aleph_2) \Rightarrow (\aleph_2,\aleph_1)$ together with the Continuum Hypothesis, $2^{\aleph_0} = \aleph_1$ , implies that there is an inner model in which the Mitchell ordering is $\geq \kappa^{+\omega}$ for some ordinal $\kappa$.

We consider certain predicative classes with respect to their bearing on set theory, namely on its semantics, and on its ontological power. On the one hand, our predicative classes will turn out to be perfectly suited for establishing a nice hierarchy of metalanguages starting from the usual set theoretical language. On the other hand, these classes will be seen to be fairly inappropriate for the formulation of strong principles of infinity. The motivation for considering this very type of classes is (...) a reasonable philosophy of set theory. Familiarity is assumed only with basic concepts of both set theory and its philosophy. (shrink)

The current paper proves the results announced in [5]. We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and $\omega$-Erdos cardinals. They are characterized by the existence of "O$^#$-like" embeddings; however, they relativize down to L. It turns out that the existence of a remarkable cardinal is equiconsistent with L absoluteness for proper forcings. In particular, said absoluteness does not imply $\Pi^1_1$ determinacy.

We show that weakly compact cardinals are the smallest large cardinals k where k+ < k+ is impossible provided 0# does not exist. We also show that if k+Kc < k+ for some k being weakly compact , then there is a transitive set M with M ⊨ ZFC + “there is a strong cardinal”.