Splitting families and complete separability
Abstract
We answer a question from Raghavan and Stepr\=ans' paper on weakly tight families by showing that s = sω, ω. Then we use this to construct a completely separable maximal almost disjoint family under ≤ , partially answering a question of Shelah.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.