Related papers: Proper forcing remastered
We present a method for iterating semiproper forcing which uses side conditions and is inspired by the technique recently introduced by Neeman.
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 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 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.
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
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…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
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 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 show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…
We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of…
We force the existence of a chain of length $\omega_3$ in $[\omega_1]^{\omega_1}$ increasing modulo finite. The construction involves symmetric systems of models of two types as side conditions, introduced by the second author. This…
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…
Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…
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 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 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…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…