2000 character limit reached
On the Isbell problem
Published 11 Oct 2024 in math.LO | (2410.08699v1)
Abstract: We present three models concerning Tukey types of ultrafilters on $\omega$. The first model is built via a countable support iteration, and we show there is no basically generated ultrafilter in such model. The second and third models are built upon different and novel techniques, and in such models all ultrafilters are Tukey top, thus providing an answer to the Isbell problem. In all models there is no $\mathsf{nwd}$-ultrafilter.
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.