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.
W.H. Woodin showed that if $κ_1 < \cdots < κ_n$ are strong cardinals then two-step ${\bfΣ}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{κ_n}}$ to be countable. We show that this number can be reduced to $2^{κ_n}$, and to $κ_n^+$ in the case $n = 1$, but cannot be further reduced to $κ_n$.
We investigate properties of trees of height $ω_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $ω_1$-tree. We introduce fragments of subcompleteness which are preserved by subcomplete forcing, and use these in order to show that certain strong forms of rigidity of Suslin trees are preserved by subcomplete forcings. Finally, we explore under what circumstances subcomplete forcing preserves Aronszajn trees of height and width $ω_1$. We show that this is the case if CH fails, and if CH holds, then this is the case iff the bounde…
Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a given ideal. We prove that for all $σ$-ideals $I$ such that the ideal forcing $\mathbb{P}_I$ of Borel sets modulo $I$ is proper, this uniformization principle is equivalent to an absoluteness principle for projective formulas with respect to $\mathbb{P}_I$ that we call internal absoluteness. In addition, we show that it is equivalent to measurability with res…
The resurrection axioms are forcing axioms introduced recently by Hamkins and Johnstone, developing on ideas of Chalons and Velicković. We introduce a stronger form of resurrection axioms (the \emph{iterated} resurrection axioms $\textrm{RA}_α(Γ)$ for a class of forcings $Γ$ and a given ordinal $α$), and show that $\textrm{RA}_ω(Γ)$ implies generic absoluteness for the first-order theory of $H_{γ^+}$ with respect to forcings in $Γ$ preserving the axiom, where $γ=γ_Γ$ is a cardinal which depends on $Γ$ ($γ_Γ=ω_1$ if $Γ$ is any among the classes of countably closed, proper, semiproper, stationar…
We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial segment of the universe of height a super compact which is a limit of super compact cardinals is a stationary set preserving partial order which forces $MM^{++}$ and collapses its size to become the second uncountable cardinal. Next we argue that any of the known methods to produce a model of $MM^{++}$ collapsing a superhuge cardinal to become the second uncoun…
We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is Sigma^1_n - P - absolute iff for every Sigma^1_n-sentence phi with parameters in V we have V models phi iff V^P models phi. We show that Sigma^1_4-Amoeba-absoluteness implies that forall a in omega^omega (omega_1^{L[a]} < omega_1^V), and hence Sigma^1_3-measurability. This answers a question of Haim Judah (private communication).
We show that for $Π_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal axioms). Among such $Π_2$-properties we mention: the negation of the Continuum hypothesis, Souslin Hypothesis, the negation of Whitehead's conjecture on free groups, the non-existence of outer automorphisms for the Calkin algebra, etc... In particular this gives an a posteriori explanation of the success forcing (and forcing axioms) met in producing models of su…
Forcing over choiceless models and generic absoluteness
Institute of logic and cognition, department of philosophy, Sun Yat-sen University（中山大学哲学系逻辑与认知研究所）；Dipartimento di ingegneria dell’informazione e scienze matematiche, Università di Siena（锡耶纳大学信息与数学工程系）
We introduce bounded category forcing axioms for well-behaved classes $Γ$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{λ_Γ^+}$ modulo forcing in $Γ$, for some cardinal $λ_Γ$ naturally associated to $Γ$. These axioms naturally extend projective absoluteness for arbitrary set-forcing--in this situation $λ_Γ=ω$--to classes $Γ$ with $λ_Γ>ω$. Unlike projective absoluteness, these higher bounded category forcing axioms do not follow from large cardinal axioms, but can be forced under mild large cardinal assumptions o…
We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{λ_{1},...,λ_{n}}^{*}$ and $C_{<λ_{1},...,<λ_{n}}^{*}$ for $λ_{1},...,λ_{n}$ regular cardinals - is set-forcing absolute under the assumption of class many Woodin cardinals, and is independent of the regular cardinals used. Towards this goal we prove some properties of the generic embedding induced from the stationary tower restricted to $<μ$-closed sets.
$Σ^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{ω_1}}^V \prec_{Σ_2}{H_{ω_1}}^{V^P}$. "$ω_1$ inaccessible to reals" means that for any real $r$, ${ω_1}^{L[r]}<ω_1$. To measure the exact consistency strength of "$Σ^1_3$-absoluteness for ccc forcing and $ω_1$ is inaccessible to reals", we introduce a weak version of a weakly compact cardinal, namely, a (lightface) $Σ^1_2$-indescribable cardinal; $κ$ has this property exactly if it is inaccessible and $H_κ\prec_{Σ_2} H_{κ^+}$.
Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of ω_1 can be made Δ^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a Δ^1_3 well-ordering of its reals; 2-step Σ^1_4 absoluteness fails w.r.t. set-sized reasonable forcings.
In [5], Hjorth proved that for every countable ordinal $α$, there exists a complete $\mathcal{L}_{ω_1,ω}$-sentence $ϕ_α$ that has models of all cardinalities less than or equal to $\aleph_α$, but no models of cardinality $\aleph_{α+1}$. Unfortunately, his solution does not yield a single $\mathcal{L}_{ω_1,ω}$-sentence $ϕ_α$, but a set of $\mathcal{L}_{ω_1,ω}$-sentences, one of which is guaranteed to work. It was conjectured in [9] that it is independent of the axioms of ZFC which of these sentences has the desired property. In the present paper, we prove that this conjecture is true. More spec…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we outline how, using basic partial order theory, it is possible to reformulate the axiom of choice, Baire's category theorem, and many large cardinal axioms as specific instances of forcing axioms. We then address forcing axioms with a model-theoretic perspective and outline a deep analogy existing between the standard Łoś Theorem for ultraproducts of first order s…
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 …
In [FHK13], the authors considered the question whether model-existence of $L_{ω_1,ω}$-sentences is absolute for transitive models of ZFC, in the sense that if $V \subseteq W$ are transitive models of ZFC with the same ordinals, $φ\in V$ and $V\models "φ\text{ is an } L_{ω_1,ω}\text{-sentence}"$, then $V \models "φ\text{ has a model of size } \aleph_α"$ if and only if $W \models "φ\text{ has a model of size } \aleph_α"$. From [FHK13] we know that the answer is positive for $α=0,1$ and under the negation of CH, the answer is negative for all $α>1$. Under GCH, and assuming the consistency of a s…
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, …
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.
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 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 suc…
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.
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.
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.
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 …
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…
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 investigate the problem of when $\leqλ$--support iterations of $<λ$--complete notions of forcing preserve $λ^+$. We isolate a property -- {\em properness over diamonds} -- that implies $λ^+$ is preserved and show that this property is preserved by $λ$--support iterations. We close with an application of our technology by presenting a consistency result on uniformizing colorings of ladder systems on $\{δ<λ^+:\cf(δ)=λ\}$ that complements a theorem of Shelah.
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 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…
It is known that the set of possible cofinalities $\mathrm{pcf}(A)$ has good properties if $A$ is a progressive interval of regular cardinals. In this paper, we give an interval of regular cardinals $A$ such that $\mathrm{pcf}(A)$ has no good properties in the presense of a measurable cardinal, or in generic extensions by Prikry-type forcing.
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…
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 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 show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $ω_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The combinatorial properties that we make use of are natural principles, and in particular for inaccessible cardinals, these principles are equivalent to their corresponding large cardinal properties. Our characterizations make use of the concepts of internal large cardinals introduced in this paper, and of the classical concept of generic elementary embeddings.
