2000 character limit reached
There is a -Ramsey \textsf{MAD} family
Published 20 Oct 2018 in math.LO | (1810.08763v1)
Abstract: We answer an old question of Michael Hru\v{s}\'{a}k by constructing a -Ramsey \textsf{MAD} family without the need of any additional axioms beyond We also prove that every Miller-indestructible \textsf{MAD }family is -Ramsey, this improves a result of Michael Hru\v{s}\'{a}k.
Paper Prompts
Sign up for free to create and run prompts on this paper.