2000 character limit reached
Dowker filters and Magidor forcing (1909.11891v1)
Published 26 Sep 2019 in math.LO
Abstract: We prove that the consistency of the existence of a Dowker filter at $\kappa+$ along with $2\kappa=\kappa+$ where $\kappa$ is regular and uncountable. Using Magidor forcing we also prove the consistency of the existence of a Dowker filter at $\mu+$ where $\mu>{\rm cf}(\mu)>\omega$.
Sponsor
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.