Related papers: Namba forcing, weak approximation, and guessing

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework by applying it to variants of the extended Namba problem, as…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Shelah considered a certain version of Strong Chang's Conjecture, which we denote $\text{SCC}^{\text{cof}}$, and proved that it is equivalent to several statements, including the assertion that Namba forcing is semiproper. We introduce an…

For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…

We introduce Strong Measuring, a maximal strengthening of J. T. Moore's Measuring principle, which asserts that every collection of fewer than continuum many closed bounded subsets of $\omega_1$ is measured by some club subset of…

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

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…

The Maximality Principle MP is a scheme which states that if a sentence of the language of ZFC is true in some forcing extension V^P, and remains true in any further forcing extension of V^P, then it is true in all forcing extensions of V.…

In a sigma-closed forcing extension, the bounded forcing axiom for Namba forcing fails. This answers a question of Justin Tatch Moore.

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call ${\rm GM}^+(\omega_3,\omega_1)$ holds. This principle implies ${\rm ISP}(\omega_2)$ and ${\rm ISP}(\omega_3)$, and…

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 show that the forcing axiom for countably compact, $\omega_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…

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

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…

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…