Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces

Archive for Mathematical Logic 61 (7):1053-1090 (2022)
  Copy   BIBTEX

Abstract

This paper investigates properties of \(\sigma \) -closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter \({\mathcal {U}}\) for _n_-tuples, denoted \(t({\mathcal {U}},n)\), is the smallest number _t_ such that given any \(l\ge 2\) and coloring \(c:[\omega ]^n\rightarrow l\), there is a member \(X\in {\mathcal {U}}\) such that the restriction of _c_ to \([X]^n\) has no more than _t_ colors. Many well-known \(\sigma \) -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 \(\sigma \) -closed forcings. These include a hierarchy of forcings due to Laflamme which generate weakly Ramsey and weaker rapid p-points, forcings of Baumgartner and Taylor and of Blass and generalizations, and the collection of non-p-points generated by the forcings \({\mathcal {P}}(\omega ^k)/\mathrm {Fin}^{\otimes k}\). We provide a general approach to calculating the Ramsey degrees of these ultrafilters, obtaining new results as well as streamlined proofs of previously known results. In the second half of the paper, we calculate pseudointersection and tower numbers for these \(\sigma \) -closed forcings and their relationships with the classical pseudointersection number \({\mathfrak {p}}\).

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2022-03-16

Downloads
16 (#1,185,835)

6 months
8 (#569,389)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
A new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
Every analytic set is Ramsey.Jack Silver - 1970 - Journal of Symbolic Logic 35 (1):60-64.
Selective ultrafilters and homogeneity.Andreas Blass - 1988 - Annals of Pure and Applied Logic 38 (3):215-255.

View all 16 references / Add more references