We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are ``reasonably'' definable. We present two specific properties materializing this intuition: nep (non-elementary properness) and snep (Souslin non-elementary properness). For this we consider candidates (countable models to which the definition applies), and the older Souslin proper. A major theme here is ``preservation by iteration'', but we also show a dichotomy: if such forcing notions preserve the positiveness of the set of old reals for some naturally define c.c.c. ideals, then they preserve the positiveness of any old positive set. We also prove that (among such forcing notions) the only one commuting with Cohen is Cohen itself.
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
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_θ$. We show that forcing with this poset adds a Kurepa tree $T$. Moreover, if $\mathcal P_c$ is a suborder of $\mathcal P$ containing only continuous matrices, then the Kurepa tree $T$ is almost Souslin, i.e. the level set of any antichain in $T$ is not stationary in $ω_1$.
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along templates, Boolean ultrapowers of forcing notions, and restrictions of forcing notions to elementary submodels.
By a virtual model, we mean a model of set theory which is elementary in its transitive closure. Virtual models are first used by Neeman \cite{neeman2014forcing} to iterate forcing. That paper is concerned with proper forcing. The method was then adjusted by Veličković to the case of semi-proper forcing and this was drafted in \cite{velickovic2021iteration}. We here straighten the details and further elaborate on Veličković's method. The first section collects facts about virtual model, the second section describes the iteration, and the third one illustrates the method in the case of getting …
This expository paper covers the first two sections of chapter VI of Shelah's book "Proper and Improper Forcing," including the preservationn (using CS iterations of proper forcings) of omega-omega bounding, Sacks property, Lavewr property, P-point property, and others.
This is an exposition of the first two sections of Chapter VI of Shelah's book Proper and Improper Forcing. It covers various preservation theorems for CS iteration of proper forcing (omega-omega bounding, Sacks property, P-point property, etc.)
We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself), including the three properties presented in this paper, imply yet another regularity property for class forcing notions, namely that proper classes of the ground model cannot become sets in a generic extension, that is they do not have set-sized names in the ground model. We then show that over certain models of Gödel-Bernays set theory without the power set axiom, …
The parameter-free part $\text{PA}_2^\ast$ of $\text{PA}_2$, the 2nd order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $ω$-model of $\text{PA}_2^\ast + \text{CA}(Σ^1_2)$, in which an example of the full Comprehension schema $\text{CA}$ fails. Using Cohen's forcing, we also define an $ω$-model of $\text{PA}_2^\ast$, in which not every set has its complement, and hence the full $\text{CA}$ fails in a rather elementary way.
We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.
The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping Reflection Principle, a consequence of PFA. While the results fall short of showing that MRP implies SCH, it will be shown that MRP implies that if SCH fails first at kappa then every stationary subset of S_{kappa^+}^omega = {a < kappa^+ : cf(a) = omega} reflects. It will also be demonstrated that MRP always fails in a generic extension by Prikry forcing.
We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles hold for $ω_2$. Using this, we argue to show that any of the known methods for forcing models of PFA from a large cardinal assumption requires a strongly compact cardinal. If one forces PFA using a proper forcing, then we get the optimal result that a supercompact cardinal is necessary.
Boban Velickovic asked the following question: Is there a nontrivial forcing notion with the Sacks property which is also ccc? A ``definable'' variant of this question has been answered in [Sh:480] (math.LO/9303208): Every nontrivial Souslin forcing notion which has the Sacks property has an uncountable antichain. Here we show that it is consistent that every nontrivial forcing notion which has the Sacks property has an uncountable antichain. Independently, Velickovic has also proved the consistency of this statement.
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support interations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
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 models by certain nice regular suborders satisfy the $ω_1$-approximation property. We prove that the existence of stationarily many $ω_1$-guessing models in $P_{ω_2}(H(θ))$, for sufficiently large cardinals $θ$, is consistent with the continuum being arbitrarily large, solving a problem of Viale and Weiss.
Assume ZF($j$) and there is a Reinhardt cardinal, as witnessed by the elementary embedding $j:V\to V$. We investigate the linear iterates $(N_α,j_α)$ of $(V,j)$, and their relationship to $(V,j)$, forcing and definability, including that for each infinite ordinal $α$, every set is set-generic over $N_α$, but $N_α$ is not a set-ground. Assume second order ZF. We prove that the existence of super Reinhardt cardinals and total Reinhardt cardinals is not affected by small forcing. And if $V[G]$ has a set of ordinals which is not in $V$, then $V[G]$ has no elementary embedding $j:V[G]\to M\subseteq…
This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering properties are also applied to investigate models of strongly compact cardinals or of strong forcing axioms like MM or PFA.
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 ω_2 with finite conditions, Koszmider's forcing construction of a strong chain of length ω_2 of functions from ω_1 to ω_1, and the Baumgartner-Shelah forcing construction of a thin very tall superatomic Boolean algebra.
We study the spectrum of forcing notions between the iterations of $σ$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $α$-proper forcings for indecomposable countable ordinals as well as the Axiom A forcings. We focus on the bounded forcing axioms for the hierarchy of $α$-proper forcings and connect them to a hierarchy of weak club guessing principles. We show that they are, in a sense, dual to each other. In particular, these weak club guessing principles separate the bounded forcing axioms for distinct countable indecomposable ordinals. In the study o…
We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize down to L. It turns out that the existence of a remarkable cardinal is equiconsistent with L(R) absoluteness under proper forcings. In particular, said absoluteness does not imply Pi^1_1 determinacy.
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 phi holding in some forcing extension V^P and all subsequent extensions V^P*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 (diamond box phi) implies (box phi), and is equivalent to the modal theory S5. In this article, I prove that the Maximality Principle is relatively consistent with ZFC. A boldface ve…
The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa is called {Sigma}_1-reflecting, if for any regular cardinal chi, for all formulas phi, ``H(chi) models `phi ' '' implies ``exists delta < kappa, H(delta) models `phi ' '' We show that BPFA is equivalent to the statement that two nonisomorphic models of size aleph_1 cannot be made isomorphic by a proper forcing notion, and we show that the consistency strength…
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 set of ordinals in $V$ cannot be added to $L({\mathbb R})$ by small forcing. The large cardinal needed corresponds to the consistency strength of $AD^{L({\mathbb R})}$; roughly $ω$ Woodin cardinals.
Given a Polish space X and a countable family of analytic hypergraphs on X, I consider the sigma-ideal generated by Borel sets which are anticliques in at least one hypergraph in the family. It turns out that many of the quotient posets are proper. I investigate the forcing properties of these posets, certain natural operations on them, and prove some related dichotomies. For this broad class of posets, most fusion arguments and iteration preservation arguments can be replaced with simple combinatorial considerations concerning the hypergraphs.
We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on the real line). For random and Cohen forcing, this question was investigated by Cicho'n and Pawlikowski; for Hechler forcing, by Judah, Shelah and myself. We show here: (1) adding an eventually different or a localization real adjoins a Luzin set of size continuum and a mad family of size omega_1; (2) Laver and Mathias forcing collapse the dominating number …
The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the countable support versions. Example: The countable support iteration of Namba forcing over a ground model of CH does not add reals. Example: A countable support iteration built from Namba forcing and Cohen forcing, over a ground model of CH, does not collapse omega_1
The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $σ$-continuity of a certain Borel not $σ$-continuous function. We give a characterization of this forcing in the language of trees and using this characterization we establish such properties of the forcing as fusion and continuous reading of names. Although the latter property is usually implied by the fact that the associated ideal is generated by closed sets, we show it is not the case with Steprans forcing. We also establish a connection between Steprans forcing and Miller forcing thus giving a new descripti…
We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.
In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular cardinal, cannot be too nice and must cause some "damage" to the structure of cardinals and stationary sets. As a consequence there is no analogue to the Prikry forcing, in terms of "nice" properties, when changing cofinalities to be uncountable.
In the first part of the paper, we show that if $ω\le κ< λ$ are cardinals, $κ^{<κ} = κ$, and $λ$ is weakly compact, then in $V[\M(κ,λ)]$ the tree property at $λ= κ^{++V[\M(κ,λ)]}$ is indestructible under all $κ^+$-cc forcing notions which live in $V[\Add(κ,λ)]$, where $\Add(κ,λ)$ is the Cohen forcing for adding $λ$-many subsets of $κ$ and $\M(κ,λ)$ is the standard Mitchell forcing for obtaining the tree property at $λ= (κ^{++})^{V[\M(κ,λ)]}$. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that $λ$ is superco…
In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy model obtained by collapsing all cardinals between omega_1 and a strongly inaccessible cardinal by forcing with a countable support Levy collapsing order many omega_1-preserving forcing notions of size at most omega_1 including all omega-proper forcing notions and some proper but not omega-proper forcing notions of size at most omega_1 do not create Kurepa tre…
Introducing unfoldable cardinals last year, Andres Villaveces ingeniously extended the notion of weak compactness to a larger context, thereby producing a large cardinal notion, unfoldability, with some of the feel and flavor of weak compactness but with a greater consistency strength. Specifically, kappa is theta-unfoldable when for any transitive structure M of size kappa that contains kappa as an element, there is an elementary embedding j:M-->N with critical point kappa for which j(kappa) is at least theta. Define that kappa is fully unfoldable, then, when it is theta-unfoldable for every …
We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain catching, enabling us to provide a solution to a problem from Foreman~\cite{MR2768692} about ideal projections which is more comprehensive and simpler than the solution obtained in \cite{MR3343538}. 2) We solve an older question from Foreman~\cite{MR819932} about the relationship between generic hugeness and generic almost hugeness. 3) Finally, we provide solutions…
Suppose that $T^*$ is an $ω_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong consequences of PFA, such as the failure of very weak club guessing, that all of the cardinal characteristics of the continuum are greater than $ω_1$, and the $P$-ideal dichotomy. On the other hand, PFA($T^*$) implies some of the consequences of diamond principles, such as the existence of Knaster forcings which are not stationarily Knaster.
In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it satisfies the Laver property. We also show some application to regularity properties. We finally present a generalized version of amoeba and discuss some interesting associated questions.
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which can be constructed using CH is moreover a tree whose square is special off the diagonal. While such trees had previously been constructed by Jensen and Kunen under the assumption of Jensen's diamond principle, this is the first time such a construction has been carried out using the Continuum Hypothesis.
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on lambda are distinct.
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the solutions we develop various ideas interesting per se.These include a new iterable condition for ``not adding Cohen reals'' (which has a flavour of preserving special properties of p-points), new intriguing properties of ultrafilters (weaker than being Ramsey but stronger than p-point) and some new applications of variants of the PP--property.
We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces diamond_{omega_1} .
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random variables defined on a pseudo-finite sample space. We show that under a fairly natural condition on the family (called compactness in K.(2011)) the resulting structure has a property that is naturally interpreted as saturation for existential types. We also give an example showing that this cannot be extended to universal types.
We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered but Martin Axiom fails for this order. Furthermore, we construct a totally nonhomogeneous Souslin forcing and we build a Souslin forcing which is proper but not ccc that does not contain a perfect set of mutually incompatible conditions. Finally we show that ccc Sigma^1_2-notions of forcing may not be indestructible ccc.
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
