Related papers: Forcing with Symmetric Systems of Models of Two Ty…

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…

We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a…

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…

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…