We present some techniques in c.c.c. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of ℵ 1 -dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two ℵ 1 -dense subsets of R are isomorphic, is consistent. We e.g. prove Con). Let K H, be the set of order types of ℵ 1 -dense homogeneous subsets of R (...) with the relation of embeddability. We prove that for every finite model L, : Con iff L is a distributive lattice. We prove that it is consistent that the Magidor-Malitz language is not countably compact. We deal with the consistency of certain topological partition theorems. E.g. We prove that MA is consistent with the axiom OCA which says: “If X is a second countable space of power ℵ 1, and { U 0,\h.;, U n−1 } is a cover of D ▪ X x X -} x,x> ¦ x ϵ X } consisting of symmetric open sets, then X can be partitioned into { X i \brvbar; i ϵ ω } such that for every i ϵ ω there is l such that D ⊇ U l ”. We also prove that MA+OCA [xrArr] 2 ℵ 0 = ℵ 2. (shrink)

In this work we give a complete answer as to the possible implications between some natural properties of Lebesgue measure and the Baire property. For this we prove general preservation theorems for forcing notions. Thus we answer a decade-old problem of J. Baumgartner and answer the last three open questions of the Kunen-Miller chart about measure and category. Explicitly, in \S1: (i) We prove that if we add a Laver real, then the old reals have outer measure one. (ii) We (...) prove a preservation theorem for countable-support forcing notions, and using this theorem we prove (iii) If we add ω 2 Laver reals, then the old reals have outer measure one. From this we obtain (iv) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg B(m) + \neg U(m) + U(c))$ . In \S2: (i) We prove a preservation theorem, for the finite support forcing notion, of the property " $F \subseteq ^\omega\omega$ is an unbounded family." (ii) We introduce a new forcing notion making the old reals a meager set but the old members of ω ω remain an unbounded family. Using this we prove (iii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + U(m) + \neg B(c) + \neg U(c) + C(c))$ . In \S3: (i) We prove a preservation theorem, for the finite support forcing notion, of a property which implies "the union of the old measure zero sets is not a measure zero set," and using this theorem we prove (ii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg U(m) + C(m) + \neg C(c))$. (shrink)

We present some techniques in c.c.c. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of ℵ 1 -dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two ℵ 1 -dense subsets of R are isomorphic, is consistent. We e.g. prove Con). Let K H , be the set of order types of ℵ 1 -dense homogeneous subsets of (...) R with the relation of embeddability. We prove that for every finite model L , : Con iff L is a distributive lattice. We prove that it is consistent that the Magidor-Malitz language is not countably compact. We deal with the consistency of certain topological partition theorems. E.g. We prove that MA is consistent with the axiom OCA which says: “If X is a second countable space of power ℵ 1 , and { U 0 ,\h.;, U n−1 } is a cover of D ▪ X x X -} x,x> ¦ x ϵ X } consisting of symmetric open sets, then X can be partitioned into { X i \brvbar; i ϵ ω } such that for every i ϵ ω there is l such that D ⊇ U l ”. We also prove that MA+OCA [xrArr] 2 ℵ 0 = ℵ 2. (shrink)

Reviewed Works:John R. Steel, A. S. Kechris, D. A. Martin, Y. N. Moschovakis, Scales on $\Sigma^1_1$ Sets.Yiannis N. Moschovakis, Scales on Coinductive Sets.Donald A. Martin, John R. Steel, The Extent of Scales in $L$.John R. Steel, Scales in $L$.

We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.

We introduce the anti-rectangle refining property for forcing notions and investigate fragments of Martin’s axiom for ℵ1 dense sets related to the anti-rectangle refining property, which is close to some fragment of Martin’s axiom for ℵ1 dense sets related to the rectangle refining property, and prove that they are really weaker fragments.

This article investigates the weak distributivity of Boolean σ-algebras satisfying the countable chain condition. It addresses primarily the question when such algebras carry a σ-additive measure. We use as a starting point the problem of John von Neumann stated in 1937 in the Scottish Book. He asked if the countable chain condition and weak distributivity are sufficient for the existence of such a measure.Subsequent research has shown that the problem has two aspects: one set theoretic and one combinatorial. Recent results (...) provide a complete solution of both the set theoretic and the combinatorial problems. We shall survey the history of von Neumann's Problem and outline the solution of the set theoretic problem. The technique that we describe owes much to the early work of Dorothy Maharam to whom we dedicate this article.§1. Complete Boolean algebras and weak distributivity. ABoolean algebrais a setBwith Boolean operationsa˅b,a˄b and −a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element,0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S−a, ordered by inclusion, with0= ∅ and1=S.Complete Boolean algebras and weak distributivity.A Boolean algebrais a setBwith Boolean operationsa˅b,a˄b and -a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element.0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S-a, ordered by inclusion, with0= ϕ and1=S. (shrink)