Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces
Natasha Dobrinen, Sonia Navarro Flores

TL;DR
This paper uses topological Ramsey space methods to compute the Ramsey degrees of various ultrafilters generated by sigma-closed forcings and explores their pseudointersection and tower numbers, linking these to classical cardinal invariants.
Contribution
It introduces a unified approach to calculating Ramsey degrees of ultrafilters from sigma-closed forcings and extends known results with new calculations and streamlined proofs.
Findings
Calculated Ramsey degrees for several classes of ultrafilters.
Established relationships between pseudointersection/tower numbers and classical invariants.
Provided new and simplified proofs for existing results.
Abstract
This paper investigates properties of -closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter for -tuples, denoted , is the smallest number such that given any and coloring , there is a member such that the restriction of to has no more than colors. Many well-known -closed forcings are known to generate ultrafilters with finite Ramsey degrees, but finding the precise degrees can sometimes prove elusive or quite involved, at best. In this paper, we utilize methods of topological Ramsey spaces to calculate Ramsey degrees of several classes of ultrafilters generated by -closed forcings. These include a hierarchy of forcings due to Laflamme which generate weakly Ramsey and weaker rapid p-points,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms
