Related papers: Forcing Axioms and construction schemes

We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…

We show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $\omega_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The…

We generically construct a model in which the ${\Pi^1_3}$-uniformization property is true, thus lowering the best known consistency strength from the existence of $M_1^{\#}$ to just $\mathsf{ZFC}$. The forcing construction can be adapted to…

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large…

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

We use the framework of Abstract Elementary Classes ($\mathrm{AEC}$s) to introduce a new Construction Principle $\mathrm{CP}(\mathbf{K},\ast)$, which generalises the Construction Principle of Eklof, Mekler and Shelah and allows for many…

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

We study various classes of maximality principles, $\rm{MP}(\kappa,\Gamma)$, introduced by J.D. Hamkins, where $\Gamma$ defines a class of forcing posets and $\kappa$ is a cardinal. We explore the consistency strength and the relationship…

We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals $\langle…

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

We force over the constructible universe to obtain a model of the $\Pi^1_3$-reduction property, thus lowering the best known large cardinal strength from the existence of $M_1^{\#}$ to just ZFC. In this model the $\Pi^1_3$-uniformization…

In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat…

The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…