Related papers: Alternative Cicho\'n Diagrams and Forcing Axioms C…

We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

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…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new ${<}\kappa$-sequences (for some regular $\kappa$). As an application, we show that consistently the following cardinal characteristics…

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

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…

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…

We use known finite support iteration techniques to present various examples of models where several cardinal characteristics of Cicho\'n's diagram are pairwise different. We show some simple examples forcing the left-hand side of…

This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which…

We reimplement the creature forcing construction used by Fischer et al. (arXiv:1402.0367) to separate Cicho\'{n}'s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our…

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

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 discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…