English

Splitting families and complete separability

Logic 2019-08-15 v1

Abstract

We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that s=sω,ω\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}. Then we use this to construct a completely separable maximal almost disjoint family under \s\a\s \leq \a, partially answering a question of Shelah.

Keywords

Cite

@article{arxiv.1204.1810,
  title  = {Splitting families and complete separability},
  author = {Heike Mildenberger and Dilip Raghavan and Juris Steprāns},
  journal= {arXiv preprint arXiv:1204.1810},
  year   = {2019}
}
R2 v1 2026-06-21T20:46:27.575Z