There are two standard ways to establish consistency in set theory. One is to prove consistency using inner models, in the way that Gödel proved the consistency of GCH using the inner model L. The other is to prove consistency using outer models, in the way that Cohen proved the consistency of the negation of CH by enlarging L to a forcing extension L[G].But we can demand more from the outer model method, and we illustrate this by examining Easton's strengthening (...) of Cohen's result:Theorem 1. There is a forcing extensionL[G] of L in which GCH fails at every regular cardinal.Assume that the universe V of all sets is rich in the sense that it contains inner models with large cardinals. Then what is the relationship between Easton's model L[G] and V? In particular, are these models compatible, in the sense that they are inner models of a common third model? If not, then the failure of GCH at every regular cardinal is consistent only in a weak sense, as it can only hold in universes which are incompatible with the universe of all sets. Ideally, we would like L[G] to not only be compatible with V, but to be an inner model of V.We say that a statement is internally consistent iff it holds in some inner model, under the assumption that there are innermodels with large cardinals. (shrink)

Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak (...) large cardinal property is necessary for the latter to hold.) In other terms we delimit its strength as follows: Theorem Con(ZFC+ω2-Π 1 1-Determinacy) ⇒ ⇒Con(ZFC+V=K+∃ a long unfoldable cardinal ⇒ ⇒Con(ZFC+∀X(X # exists) + ‘‘ $\forall D \subseteq \omega_1 D$ is universally Baire ⇔ ∃r∈R(D∈L(r)))’’, and this is set-generically absolute). We isolate a notion of ω-closed cardinal which is weaker than an ω1-Erd\ os cardinal, and show that this bounds the first long unfoldable: Theorem Let κ be ω -closed. Then there is a long unfoldable ł<κ. (shrink)

In this paper, following an idea of Christophe Chalons. I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence varphi holding in some forcing extension $V^P$ and all subsequent extensions $V^{P\ast Q}$ holds already in V. It follows, in fact, that such sentences must also hold in all forcing extensions of V. In modal terms, therefore, the Maximality Principle is expressed by the scheme $(\lozenge \square \varphi) \Rightarrow \square \varphi$ , and is equivalent to (...) the modal theory S5. In this article. I prove that the Maximality Principle is relatively consistent with ZFC. A boldface version of the Maximality Principle, obtained by allowing real parameters to appear in φ, is equiconsistent with the scheme asserting that $V_\delta \prec V$ for an inaccessible cardinal δ, which in turn is equiconsistent with the scheme asserting that ORD is Mahlo. The strongest principle along these lines is $\square MP\!_{\!\!\!\!\!\!_{\!\!_\sim}}$ , which asserts that $MP\!_{\!\!\!\!\!\!_{\!\!_\sim}}$ holds in V and all forcing extensions. From this, it follows that $0^\#$ exists, that $x^\#$ exists for every set x, that projective truth is invariant by forcing, that Woodin cardinals are consistent and much more. Many open questions remain. (shrink)

The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery preparation makes these cardinals indestructible by various kinds of further forcing. A supercompact cardinal κ, for example, becomes fully indestructible by <κ-directed closed forcing; a strong cardinal κ becomes indestructible by κ-strategically closed forcing; and a strongly compact cardinal κ becomes indestructible by, among others, the forcing to (...) add a Cohen subset to κ, the forcing to shoot a club Cκ avoiding the measurable cardinals and the forcing to add various long Prikry sequences. The lottery preparation works best when performed after fast function forcing, which adds a new completely general kind of Laver function for any large cardinal, thereby freeing the Laver function concept from the supercompact cardinal context. (shrink)

The class forcing theorem, which asserts that every class forcing notion ${\mathbb {P}}$ admits a forcing relation $\Vdash _{\mathbb {P}}$, that is, a relation satisfying the forcing relation recursion—it follows that statements true in the corresponding forcing extensions are forced and forced statements are true—is equivalent over Gödel–Bernays set theory $\text {GBC}$ to the principle of elementary transfinite recursion $\text {ETR}_{\text {Ord}}$ for class recursions of length $\text {Ord}$. It is also equivalent to the existence of truth predicates for the (...) infinitary languages $\mathcal {L}_{\text {Ord},\omega }$, allowing any class parameter A; to the existence of truth predicates for the language $\mathcal {L}_{\text {Ord},\text {Ord}}$ ; to the existence of $\text {Ord}$ -iterated truth predicates for first-order set theory $\mathcal {L}_{\omega,\omega }$ ; to the assertion that every separative class partial order ${\mathbb {P}}$ has a set-complete class Boolean completion; to a class-join separation principle; and to the principle of determinacy for clopen class games of rank at most $\text {Ord}+1$. Unlike set forcing, if every class forcing notion ${\mathbb {P}}$ has a forcing relation merely for atomic formulas, then every such ${\mathbb {P}}$ has a uniform forcing relation applicable simultaneously to all formulas. Our results situate the class forcing theorem in the rich hierarchy of theories between $\text {GBC}$ and Kelley–Morse set theory $\text {KM}$. (shrink)

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.

We present a variety of (ω 1 ,∞)-distributive forcings which when applied to models of Martin's Maximum separate certain well known reflection principles. In particular, we do this for the reflection principles SR, SR α (α ≤ ω 1 ), and SRP.

A transitive model M of ZFC is called a ground if the universe V is a set forcing extension of M. We show that the grounds ofV are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method and the set-theoretic geology. For instance, the mantle, the intersection of all grounds, must be a model of ZFC. V has only set many grounds if and only if the mantle is a ground. We also show that if the universe (...) has some very large cardinal, then the mantle must be a ground. (shrink)

We show in ZFC that if there is no proper class inner model with a Woodin cardinal, then there is an absolutely definablecore modelthat is close toVin various ways.

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which satisfies it. The Ground Axiom is independent of many well-known set-theoretic assertions including the Generalized Continuum Hypothesis, the assertion V=HOD that every set is ordinal definable, and the existence of measurable and supercompact cardinals. The related Bedrock Axiom, asserting that the (...) universe is a set forcing extension of a model satisfying the Ground Axiom, is also first-order expressible, and its negation is consistent. (shrink)