On weakly tight families
Abstract
Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when < ω, we construct a weakly tight family under the hypothesis ≤ < ω. The case when < is handled in and does not require < ω, while an additional PCF type hypothesis, which holds when < ω is used to treat the case = . The notion of a weakly tight family is a natural weakening of the well studied notion of a Cohen indestructible maximal almost disjoint family. It was introduced by Hrus\'ak and Garc\'a Ferreira Hr1, who applied it to the Kat\'etov order on almost disjoint families.
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.