Article ID Journal Published Year Pages File Type
4662326 Annals of Pure and Applied Logic 2012 15 Pages PDF
Abstract

We study Tukey types of ultrafilters on ω, focusing on the question of when Tukey reducibility is equivalent to Rudin–Keisler reducibility. We give several conditions under which this equivalence holds. We show that there are only c many ultrafilters that are Tukey below any basically generated ultrafilter. The class of basically generated ultrafilters includes all known ultrafilters that are not Tukey above [ω1]<ω. We give a complete characterization of all ultrafilters that are Tukey below a selective. A counterexample showing that Tukey reducibility and RK reducibility can diverge within the class of P-points is also given.

Related Topics
Physical Sciences and Engineering Mathematics Logic