Skip to main content Accesibility Help

Splitting Families and Complete Separability

  • Heike Mildenberger (a1), Dilip Raghavan (a2) and Juris Steprans (a3)

We answer a question from Raghavan and Steprans by showing that Then we use this to construct a completely separable maximal almost disjoint family under a, partially answering a question of Shelah.

Hide All
[1] Balcar, B., Dočkálková, J., and Simon, P., Almost disjoint families of countable sets. In: Finite and infinite sets, Vol. I, II (Eger, 1981), Colloq. Math. Soc. János Bolyai 37, North-Holland, Amsterdam, 1984, 5988.
[2] Balcar, B. and Simon, P., Disjoint refinement. In: Handbook of Boolean algebras, Vol. 2, North-Holland, Amsterdam, 1989, 333388.
[3] Erdʺos, P. and Shelah, S., Separability properties of almost-disjoint families of sets. Israel J. Math. 12 (1972), 207214.
[4] Kamburelis, A. and Węglorz, B., Splittings. Arch. Math. Logic 35 (1996), 263277.
[5] Raghavan, D. and Steprans, J., On weakly tight families. Canad. J. Math., to appear.
[6] Shelah, S., Mad families and sane player. Preprint, 0904.0816.
[7] Simon, P., A note on almost disjoint refinement. In: 24thWinter School on Abstract Analysis (Benešova Hora, 1996), Acta Univ. Carolin. Math. Phys. 37 (1996), 8999.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Mathematical Bulletin
  • ISSN: 0008-4395
  • EISSN: 1496-4287
  • URL: /core/journals/canadian-mathematical-bulletin
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed