Related papers: Hechler's theorem for the meager ideal
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 null ideal of the…
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…
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…
The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…
We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…
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…
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).
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…
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…
I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.
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…
We show that an ideal $\mathcal{I}$ on the positive integers is meager if and only if there exists a bounded nonconvergent real sequence $x$ such that the set of subsequences [resp. permutations] of $x$ which preserve the set of…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…
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…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
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…
A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…