2000 character limit reached
Splitting, Bounding, and Almost Disjointness can be quite Different
Published 5 Aug 2015 in math.LO | (1508.01068v2)
Abstract: We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where each of these cardinal invariants assume arbitrary uncountable regular values.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.