We show that there are models of MA where the boldface $Σ^1_3$-uniformization property holds. Further we show that BPFA and the assertion $\aleph_1$ is accessible to reals outright implies that the boldface $Σ^1_3$-uniformization property is true.
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…
Given a cardinal $λ$, category forcing axioms for $λ$-suitable classes $Γ$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_λ$, modulo generic extensions via forcing notions from $Γ$. $\mathsf{MM}^{+++}$ was the first category forcing axiom to be isolated (by the second author). In this paper we present, without proofs, a general theory of category forcings, and prove the existence of $\aleph_1$-many pairwise incompatible category forcing axioms for $ω_1$-suitable classes.
In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to $\aleph\_1$. Later we give applications, among them the consistency of ${\rm MM}$ with $\aleph\_ω$ not being Jonsson which answers a question raised during Oberwolfach 2005.
We prove that the forcing axiom $MA^{1.5}_{\aleph_2}(\mbox{stratified})$ implies $\Box_{ω_1, ω_1}$. Using this implication, we show that the forcing axiom $MM_{\aleph_2}(\aleph_2\mbox{-c.c.})$ is inconsistent. We also derive weak Chang's Conjecture from $MA^{1.5}_{\aleph_2}(\mbox{stratified})$ and use this second implication to give another proof of the inconsistency of $MM_{\aleph_2}(\aleph_2\mbox{-c.c.})$.
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 show that the forcing axiom for countably compact, $ω_2$-Knaster, well-met posets is inconsistent. This is supplemental to an inconsistency result of Shelah and sets a new limit to the generalization of Martin's Axiom to the stage of $ω_2$.
Methods of Higher Forcing Axioms was a small workshop in Norwich, taking place between 10--12 of September, 2019. The goal was to encourage future collaborations, and create more focused threads of research on the topic of higher forcing axioms. This is an improved version of the notes taken during the meeting by Asaf Karagila.
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 show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.
We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $λ$-complete $μ^+$-c.c. forcing notions. We also show some versions are really stronger than others.
In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three similar partial orders in the Basic Cohen model for the failure of the axiom of choice. We show that despite their apparent similarity the maximum principle holds for only one of the three.
David Aspero asks on the possibility of having Forcing axiom FA_{aleph_2}(K), where K is the class of forcing notions preserving stationarity of subsets of aleph_1 and of aleph_2. We answer negatively, in fact we show the negative result for any regular lambda>aleph_1 even demanding adding no new sequence of ordinals of length<lambda.
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 study principles of the form: if a name $σ$ is forced to have a certain property $φ$, then there is a ground model filter $g$ such that $σ^g$ satisfies $φ$. We prove a general correspondence connecting these name principles to forcing axioms. Special cases of the main theorem are: Any forcing axiom can be expressed as a name principle. For instance, $\mathsf{PFA}$ is equivalent to a principle for rank $1$ names (equivalently, nice names) for subsets of $ω_1$, and a principle for rank $2$ names for sets of reals. Moreover, $λ$-bounded forcing axioms are equivalent to name principles. Bagaria…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing notion for~$λ$" we shall say "for every such family of forcing notions, depending on stationary $S\subseteq λ$, for some such stationary set we have\dots". Such notions of forcing are important for Abelian group theory, but this application is delayed for a sequel.
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.
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.
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.
I explore two separate topics: the concept of jointness for set-theoretic guessing principles, and the notion of grounded forcing axioms. A family of guessing sequences is said to be joint if all of its members can guess any given family of targets independently and simultaneously. I primarily investigate jointness in the case of various kinds of Laver diamonds. In the case of measurable cardinals I show that, while the assertions that there are joint families of Laver diamonds of a given length get strictly stronger with increasing length, they are all equiconsistent. This is contrasted with …
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 $λ$, if $λ^{++}$ is not a Mahlo cardinal in Gödel's constructible universe, then $2^λ= λ^+$ entails the existence of a $λ^+$-complete $λ^{++}$-Souslin tree.
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.
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which satisfies it. The Ground Axiom is independent of many well-known set-theoretic assertions including the Generalized Continuum Hypothesis, the assertion V=HOD that every set is ordinal definable, and the existence of measurable and supercompact cardinals. The related Bedrock Axiom, asserting that the universe is a set-forcing extension of a model satisfying the Gr…
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…
$\mathsf{ZF + AD}$ proves that for all nontrivial forcings $\mathbb{P}$ on a wellorderable set of cardinality less than $Θ$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$. $\mathsf{ZF + AD} + Θ$ is regular proves that for all nontrivial forcing $\mathbb{P}$ which is a surjective image of $\mathbb{R}$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$. In particular, $\mathsf{ZF + AD + V = L(\mathbb{R})}$ proves that for every nontrivial forcing $\mathbb{P} \in L_Θ(\mathbb{R})$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$.
These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of Turin in the academic year 2011-2012. Our purpose is to give a brief account on forcing axioms with a special focus on some consequences of them (SRP, OCA, PID). These principles were first isolated by Todor\v cević and interpolate most consequences of MM and PFA, thus providing a useful insight on the combinatorial structure of the theory of forcing axioms. In the first part of this notes we will give a brief account on forcing axioms, introducing some equivalent …
In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions that homogenize colorings over them is uncovered. At the level of the first uncountable cardinal this gives rise to a duality theorem under Martin's Axiom: a function $p:[ω_1]^2\rightarrowω$ witnesses a weak negative Ramsey relation when $p$ plays the role of a coloring if and only if a positive Ramsey relation holds over $p$ when $p$ plays the role of a partition. The consistency of posi…
We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $ω_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not decide whether the restriction of the non-stationary ideal on $ω_2$ to sets of ordinals of countable cofinality is $Δ_1$-definable by formulas with parameters in $H(ω_3)$. The techniques developed in the proof of this result also allow us to prove analogous results for the full non-stationary ideal on $ω_2$ and strong forcing axioms that are compatible with CH. Fin…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which satisfies it. The Ground Axiom is independent of many well-known set-theoretic assertions including the Generalized Continuum Hypothesis, the assertion V=HOD that every set is ordinal definable, and the existence of measurable and supercompact cardinals. The related Bedrock Axiom, asserting that the universe is a set forcing extension of a model satisfying the Gr…
Given a tree $T$ of height $ω_1$, we say that a ladder system colouring $(f_α)_{α\in \limω_1}$ has a $T$-uniformization if there is a function $φ$ defined on a subtree $S$ of $T$ so that for any $s\in S_α$ of limit height and almost all $ξ\in {dom} (f_α)$, $φ(s\upharpoonright ξ)=f_α(ξ)$. In sharp contrast to the classical theory of uniformizations on $ω_1$, J. Moore proved that CH is consistent with the statement that any ladder system colouring has a $T$-uniformization (for any Aronszajn tree $T$). Our goal is to present a fine analysis of ladder system uniformization on trees pointing out th…
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 introduce a class of notions of forcing which we call $Σ$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $Σ$-Prikry. We show that given a $Σ$-Prikry poset $\mathbb P$ and a name for a non-reflecting stationary set $T$, there exists a corresponding $Σ$-Prikry poset that projects to $\mathbb P$ and kills the stationarity of $T$. Then, in a sequel to this paper, we develop an iteration scheme for $Σ$-Prikry posets. Putting the two works together, we obtain a proof of the following. Theorem. If $κ$ is the…
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…
It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the preservation of the axiom scheme of replacement, for class forcing over models of $\mathsf{ZF}$. We show that pretameness in fact has various other characterizations, for instance in terms of the forcing theorem, the preservation of the axiom scheme of separation, the forcing equivalence of partial orders and their dense suborders, and the existence of nice names for …
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ń diagram. First I show that for a wide variety of reduction concepts there is a Cichoń diagram for effective cardinal characteristics relativized to that reduction. As an application I investigate in detail the Cichoń diagram for degrees of constructibility relative to a fixed inner model of ZFC. Then I study generalizations of cardinal characteristics to the space of functions …
