How to drive our families mad
Sakaé Fuchino, Stefan Geschke, Osvaldo Guzman, Lajos Soukup
Abstract
Given a family F of pairwise almost disjoint sets on a countable set S, we study maximal almost disjoint (mad) families F+ extending F. We define a+(F) to be the minimal possible cardinality of F+ F for such F+, and a+(κ)=\a+(F): |F| ≤ κ\. We show that all infinite cardinal less than or equal to the continuum continuum can be represented as a+(F) for some almost disjoint F and that the inequalities 1=a<a+(1)=c and a=a+(1)<c are both consistent. We also give a several constructions of mad families with some additional properties.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski