Related papers: Forcing axioms via ground model interpretations
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…
We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…
I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
Model semantics for first-order predicate logic is characterized by a visual inference tool called semantic forcing trees for predicate logic. Formulas that are valid (or invalid) by semantic forcing trees match valid (or invalid) formulas…
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 class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…
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…
We produce, relative to a ${\sf ZFC}$ model with a supercompact cardinal, a ${\sf ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega_1$ is $\Pi_1$-definable in a parameter from $H_{\aleph_2}$.
Suppose that $T^*$ is an $\omega_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…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…
In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.
We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
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 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…
We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…
With infinitely many high-quality data points, infinite computational power, an infinitely large foundation model with a perfect training algorithm and guaranteed zero generalization error on the pretext task, can the model be used for…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…