Papers
Topics
Authors
Recent
Search
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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.