Related papers: Few new reals

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…

We present and analyze $F_\sigma$-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as $\mathsf{ACA}_0$ and…

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

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…

The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…

We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…

We investigate forcing and independence questions relating to construction schemes. We show that adding $\kappa\geq\omega_1$ Cohen reals adds a capturing construction scheme. We study the weaker structure of $n$-capturing construction…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

In a previous paper, we introduced a way of constructing a forcing along a simplified gap-1 morass such that the forcing satisfies a chain condition. Now, we generalize this to gap-2 morasses. As an application, we prove that GCH is…

We continue the development of the theory of capturing schemes over $\omega_1$ by analyzing the relation between the capturing construction schemes (whose existence is implied by Jensen's $\Diamond$-principle) and both the Continuum…

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.

In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…

One of the most frustrating problems faced by set theorists working with iterated proper forcing is the lack of techniques for producing models in which the continuum has size greater than the second uncountable cardinal. In this paper we…

Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show that s<chi is consistent. We thus answer a question by…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…