The consistency of 𝔟 = κ and 𝔰 = κ⁺
Using finite support iteration of ccc partial orders we provide a model of 𝔟 = κ < 𝔰 = κ⁺ for κ an arbitrary regular, uncountable cardinal.
Template iterations and maximal cofinitary groups
Jörg Brendle (2003) used Hechler’s forcing notion for adding a maximal almost disjoint family along an appropriate template forcing construction to show that (the minimal size of a maximal almost disjoint family) can be of countable cofinality. The main result of the present paper is that , the minimal size of a maximal cofinitary group, can be of countable cofinality. To prove this we define a natural poset for adding a maximal cofinitary group of a given cardinality, which enjoys certain combinatorial...
Non-dominating ultrafilters
Page 1