We define a forcing poset which adds a club subset of a given fat stationary set S⊆ω2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${S \subseteq \omega_2}$$\end{document} with finite conditions, using S-adequate sets of models as side conditions. This construction, together with the general amalgamation results concerning S-adequate sets on which it is based, is substantially shorter and simpler than our original version in Krueger :119–136, 2014).

In this paper we are concerned about the ways GCH can fail in relation to rank-into-rank hypotheses, i.e., very large cardinals usually denoted by I3, I2, I1 and I0. The main results are a satisfactory analysis of the way the power function can vary on regular cardinals in the presence of rank-into-rank hypotheses and the consistency under I0 of the existence of j:Vλ+1≺Vλ+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${j : V_{\lambda+1} {\prec} V_{\lambda+1}}$$\end{document} with the failure of GCH (...) at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lambda}$$\end{document}. (shrink)

We investigate large cardinal axioms beyond the level of ω-huge in context of the universality of the suitable extender models of [Suitable Extender Models I, J. Math. Log.10 101–339]. We show that there is an analog of ADℝ at the level of ω-huge, more precisely the construction of the minimum model of ADℝ generalizes to the level of Vλ+1. This allows us to formulate the indicated generalization of ADℝ and then to prove that if the axiom holds in V at (...) a proper class of λ then in every suitable extender model, the axiom holds at a proper class of λ. (shrink)

We present several results relating the general theory of the stationary tower forcing developed by Woodin with forcing axioms. In particular we show that, in combination with class many Woodin cardinals, the forcing axiom MM++ makes the Π2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi_2}$$\end{document}-fragment of the theory of Hℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\aleph_2}}$$\end{document} invariant with respect to stationary set preserving forcings that preserve BMM. We argue that this is a promising generalization to (...) Hℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\aleph_2}}$$\end{document} of Woodin’s absoluteness results for L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${L}$$\end{document}. In due course of proving this, we shall give a new proof of some of these results of Woodin. Finally we relate our generic absoluteness results with the resurrection axioms introduced by Hamkins and Johnstone and with their unbounded versions introduced by Tsaprounis. (shrink)

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than $\aleph_{1}$, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important (...) since a proof using finite supports is more amenable to generalizations to cardinals greater than $\aleph_{1}$. (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)

We show that Bounded Forcing Axioms (for instance, Martin's Axiom, the Bounded Proper Forcing Axiom, or the Bounded Martin's Maximum) are equivalent to principles of generic absoluteness, that is, they assert that if a $\Sigma_1$ sentence of the language of set theory with parameters of small transitive size is forceable, then it is true. We also show that Bounded Forcing Axioms imply a strong form of generic absoluteness for projective sentences, namely, if a $\Sigma^1_3$ sentence with parameters is forceable, then (...) it is true. Further, if for every real x, $x^{\sharp}$ exists, and the second uniform indiscernible is less than $\omega_2$ , then the same holds for $\Sigma^1_4$ sentences. (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 ω-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 consider several kinds of partition relations on the set ${\mathbb{R}}$ of real numbers and its powers, as well as their parameterizations with the set ${[\mathbb{N}]^{\mathbb{N}}}$ of all infinite sets of natural numbers, and show that they hold in some models of set theory. The proofs use generic absoluteness, that is, absoluteness under the required forcing extensions. We show that Solovay models are absolute under those forcing extensions, which yields, for instance, that in these models for every well ordered partition (...) of ${\mathbb{R}^\mathbb{N}}$ there is a sequence of perfect sets whose product lies in one piece of the partition. Moreover, for every finite partition of ${[\mathbb{N}]^{\mathbb{N}} \times \mathbb{R}^{\mathbb{N}}}$ there is ${X \in [\mathbb{N}]^{\mathbb{N}}}$ and a sequence ${\{P_{k} : k \in \mathbb{N}\}}$ of perfect sets such that the product ${[X]^{\mathbb{N}} \times \prod_{k}^{\infty}P_{k}}$ lies in one piece of the partition, where ${[X]^{\mathbb{N}}}$ is the set of all infinite subsets of X. The proofs yield the same results for Borel partitions in ZFC, and for more complex partitions in any model satisfying a certain degree of generic absoluteness. (shrink)

We study the preservation of the property of being a Solovay model under proper projective forcing extensions. We show that every strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of under strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of under projective strongly-proper forcing notions is consistent relative to the existence of a -Mahlo cardinal. We also show that the consistency strength of the absoluteness of under (...) forcing extensions with σ-linked forcing notions is exactly that of the existence of a Mahlo cardinal, in contrast with the general ccc case, which requires a weakly-compact cardinal. (shrink)

We study the preservation under projective ccc forcing extensions of the property of L(ℝ) being a Solovay model. We prove that this property is preserved by every strongly-̰Σ₃¹ absolutely-ccc forcing extension, and that this is essentially the optimal preservation result, i.e., it does not hold for Σ₃¹ absolutely-ccc forcing notions. We extend these results to the higher projective classes of ccc posets, and to the class of all projective ccc posets, using definably-Mahlo cardinals. As a consequence we obtain an exact (...) equiconsistency result for generic absoluteness under projective absolutely-ccc forcing notions. (shrink)

We develop a general framework for forcing with coherent adequate sets on [Formula: see text] as side conditions, where [Formula: see text] is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent adequate type forcings. The main theorem of the paper is that any coherent adequate type forcing preserves CH. We show that there exists a forcing poset for adding a club subset of [Formula: see text] with finite conditions while preserving CH, solving (...) a problem of Friedman [Forcing with finite conditions, in Set Theory: Centre de Recerca Matemática, Barcelona, 2003–2004, Trends in Mathematics, pp. 285–295.]. (shrink)

We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an uplifting cardinal.

The resurrection axioms are forms of forcing axioms that were introduced recently by Hamkins and Johnstone, who developed on earlier ideas of Chalons and Veličković. In this note, we introduce a stronger form of resurrection and show that it gives rise to families of axioms which are consistent relative to extendible cardinals, and which imply the strongest known instances of forcing axioms, such as Martin’s Maximum++. In addition, we study the unbounded resurrection postulates in terms of consistency lower bounds, obtaining, (...) for example, failures of the weak square principle. (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)