Related papers: Coherent Adequate Forcing and Preserving CH

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 $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

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…

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Suppose $\kappa$ is a singular strong limit cardinal of countable cofinality and let $\langle \kappa_{n}: n<\omega \rangle$ be an incrasing sequence of regular cardinals cofinal in $\kappa$. We show that if $cf(2^\kappa)= \kappa^+$, then…

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…

Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…

We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of…

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…

In this paper, we study the global well-posedness for the Camassa-Holm(C-H) equation with a forcing in $H^1(\mathbb{R})$ by the characteristic method. Due to the forcing, many important properties to study the well posedness of weak…

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

We answer Question~3.2 from Shelah \cite{Sh:666}: Given a maximal almost disjoint (mad) family $\mathcal A$ of size $\aleph_1$, we construct a forcing ${\mathbb Q}(\mathcal A)$ that has Axiom A, is ${}^\omega \omega$-bounding, preserves…

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…

We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…

We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…