OCA and towers in
We shall show that Open Coloring Axiom has different influence on the algebra than on . The tool used to accomplish this is forcing with a Suslin tree.
We shall show that Open Coloring Axiom has different influence on the algebra than on . The tool used to accomplish this is forcing with a Suslin tree.
The Kalikow problem for a pair (λ,κ) of cardinal numbers,λ > κ (in particular κ = 2) is whether we can map the family of ω-sequences from λ to the family of ω-sequences from κ in a very continuous manner. Namely, we demand that for η,ν ∈ ω we have: η, ν are almost equal if and only if their images are. We show consistency of the negative answer, e.g., for but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants.
We show that in the -stage countable support iteration of Mathias forcing over a model of CH the complete Boolean algebra generated by absolutely divergent series under eventual dominance is not isomorphic to the completion of P(ω)/fin. This complements Vojtáš’ result that under the two algebras are isomorphic [15].
We prove that, under CH, for each Boolean algebra A of cardinality at most the continuum there is an embedding of A into P(ω)/fin such that each automorphism of A can be extended to an automorphism of P(ω)/fin. We also describe a model of ZFC + MA(σ-linked) in which the continuum is arbitrarily large and the above assertion holds true.
We partially strengthen a result of Shelah from [Sh] by proving that if and is a CCC partial order with e.g. (the successor of ) and then is -linked.