Canonical fragments of the strong reflection principle

For an arbitrary forcing class [Formula: see text], the [Formula: see text]-fragment of Todorčević’s strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for [Formula: see text] implies the [Formula: see text]-fragment of SRP , (2) the stationary set preserving fragment of SRP is the full principle SRP , and (3) the subcomplete fragment of SRP implies the major consequences of the subcomplete forcing axiom. This fragment of SRP is consistent with CH , and even with Jensen’s principle [Formula: see text]. Along the way, some hitherto unknown effects of (the subcomplete fragment of) SRP on mutual stationarity are explored, and some limitations to the extent to which fragments of SRP may capture the effects of their corresponding forcing axioms are established.

Forcing axioms and coronas of C∗-algebras

We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable [Formula: see text]-algebras with the metric approximation property and an increasing approximate identity of projections.

Rado’s Conjecture and its Baire version

Rado’s Conjecture is a compactness/reflection principle that says any nonspecial tree of height [Formula: see text] has a nonspecial subtree of size [Formula: see text]. Though incompatible with Martin’s Axiom, Rado’s Conjecture turns out to have many interesting consequences that are also implied by certain forcing axioms. In this paper, we obtain consistency results concerning Rado’s Conjecture and its Baire version. In particular, we show that a fragment of [Formula: see text], which is the forcing axiom for Baire Indestructibly Proper forcings, is compatible with the Baire Rado’s Conjecture. As a corollary, the Baire Rado’s Conjecture does not imply Rado’s Conjecture. Then we discuss the strength and limitations of the Baire Rado’s Conjecture regarding its interaction with stationary reflection principles and some families of weak square principles. Finally, we investigate the influence of Rado’s Conjecture on some polarized partition relations.

Forcing

The method of forcing was introduced by Paul J. Cohen in order to prove the independence of the axiom of choice (AC) from the basic (ZF) axioms of set theory, and of the continuum hypothesis (CH) from the accepted axioms (ZFC = ZF + AC) of set theory (see set theory, axiom of choice, continuum hypothesis). Given a model M of ZF and a certain P∈M, it produces a ‘generic’ G⊆P and a model N of ZF with M⊆N and G∈N. By suitably choosing P, N can be ‘forced’ to be or not be a model of various hypotheses, which are thus shown to be consistent with or independent of the axioms. This method of proving undecidability has been very widely applied. The method has also motivated the proposal of new so-called forcing axioms to decide what is otherwise undecidable, the most important being that called Martin’s axiom (MA).

SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS

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 forcing. 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 bounded subcomplete forcing axiom holds. Finally, we explore the relationships between bounded forcing axioms, preservation of Aronszajn trees of height and width ω1 and generic absoluteness of ${\rm{\Sigma }}_1^1$-statements over first order structures of size ω1, also for other canonical classes of forcing.

HIERARCHIES OF (VIRTUAL) RESURRECTION AXIOMS

I analyze the hierarchies of the bounded resurrection axioms and their “virtual” versions, the virtual bounded resurrection axioms, for several classes of forcings (the emphasis being on the subcomplete forcings). I analyze these axioms in terms of implications and consistency strengths. For the virtual hierarchies, I provide level-by-level equiconsistencies with an appropriate hierarchy of virtual partially super-extendible cardinals. I show that the boldface resurrection axioms for subcomplete or countably closed forcing imply the failure of Todorčević’s square at the appropriate level. I also establish connections between these hierarchies and the hierarchies of bounded and weak bounded forcing axioms.