Journal of Symbolic Logic · 2013 · 12 citations · 8 references
Natural SciencesMathematicsDiscrete MathematicsSet TheoryTopologyAxiomatic Set TheoryCombinatorial Set TheoryDisjoint Set UnionOrdinal NumbersAlmost Disjoint FamiliesPerfect Set PropertyPerfect Sets
Abstract We prove the consistency of together with the existence of a -definable mad family, answering a question posed by Friedman and Zdomskyy in [7, Question 16]. For the proof we construct a mad family in L which is an ℵ 1 -union of perfect a.d. sets, such that this union remains mad in the iterated Hechler extension. The construction also leads us to isolate a new cardinal invariant, the Borel almost-disjointness number , defined as the least number of Borel a.d. sets whose union is a mad family. Our proof yields the consistency of (and hence, ).
8
Infinite combinatorics and definability
Arnold W. Miller · Annals of Pure and Applied Logic · 1989 · 90 citations
Adjoining dominating functions
James E. Baumgartner, Peter Lars Dordal · Journal of Symbolic Logic · 1985 · 83 citations
Cohen-stable families of subsets of integers
Miloš S. Kurilić · Journal of Symbolic Logic · 2001 · 28 citations