Related papers: More about lambda-support iterations of <lambda-co…

We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

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…

We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section…

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 show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if…

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Given a forcing notion $P$ that forces certain values to several classical cardinal characteristics of the reals, we show how we can compose $P$ with a collapse (of a cardinal $\lambda>\kappa$ to $\kappa$) such that the composition still…

This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

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…

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…

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…