Related papers: NNR Revisited

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…

Using an invariant modification of Jensen's "minimal $\varPi^1_2$ singleton" forcing, we define a model of ZFC, in which, for a given $n\ge2$, there exists a lightface $\varPi^1_n$ unordered pair of non-OD (hence, OD-indiscernible)…

Starting from large cardinals we construct a pair $V_1\subseteq V_2$ of models of $ZFC$ with the same cardinals and cofinalities such that $GCH$ holds in $V_1$ and fails everywhere in $V_2$.

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

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…

We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…

We use a recently discovered constrained de Finetti reduction (aka "Post-Selection Lemma") to study the parallel repetition of multi-player non-local games under no-signalling strategies. Since the technique allows us to reduce general…

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…

In this paper, we prove that $\mathsf{ZFC+WA}_{n+1}$ implies the consistency of $\mathsf{ZFC+WA}_n$ for $n\ge 0$. We also prove that $\mathsf{ZFC+WA}_n$ is finitely axiomatizable, and $\mathsf{ZFC+WA}$ is not finitely axiomatizable.

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

In this paper we show that for every $2\leq n\in \mathbb{N}$, the statement "there is an $n$-entangled set, but there are no $n+1$-entangled sets" is consistent. We also prove some theorems which improve our understanding of entangled sets…

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

We show that assuming $\mathsf{ZF}+\mathsf{AD}^+ +$ "$V = \mathrm{L} \bigl(\wp (\mathbb{R})\bigr)$", any poset which increases $\Theta$ does not preserve the truth of $\mathsf{AD}$. We also show that in $\mathsf{ZF} + \mathsf{AD}$, any…

We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067,…

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…

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…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…