We discuss the finite-to-one Rudin-Keisler ordering of ultrafilters on the natural numbers, which we baptize the Rudin-Blass ordering in honour of Professor Andreas Blass who worked extensively in the area. We develop and summarize many of its properties in relation to its bounding and dominating numbers, directedness, and provide applications to continuum theory. In particular, we prove in ZFC alone that there exists an ultrafilter with no Q-point below in the Rudin-Blass ordering.

We prove various results on the notion of ordinal ultrafilters introduced by J. Baumgartner. In particular, we show that this notion of ultrafilter complexity is independent of the more familiar Rudin-Keisler ordering.

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}}\). (shrink)

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fraïssé classes of finite relational structures satisfying the Ramsey property. The Product Ramsey Theorem of Sokič is extended to equivalence relations for finite products of structures from Fraïssé classes of finite relational structures satisfying the Ramsey property and the Order-Prescribed Free Amalgamation Property. This is essential to proving Ramsey-classification theorems for equivalence relations on fronts, generalizing the (...) Pudlák–Rödl Theorem to this class of topological Ramsey spaces. To each topological Ramsey space in this framework corresponds an associated ultrafilter satisfying some weak partition property. By using the correct Fraïssé classes, we construct topological Ramsey spaces which are dense in the partial orders of Baumgartner and Taylor generating p-points which are k-arrow but not \-arrow, and in a partial order of Blass producing a diamond shape in the Rudin-Keisler structure of p-points. Any space in our framework in which blocks are products of n many structures produces ultrafilters with initial Tukey structure exactly the Boolean algebra \\). If the number of Fraïssé classes on each block grows without bound, then the Tukey types of the p-points below the space’s associated ultrafilter have the structure exactly \. In contrast, the set of isomorphism types of any product of finitely many Fraïssé classes of finite relational structures satisfying the Ramsey property and the OPFAP, partially ordered by embedding, is realized as the initial Rudin-Keisler structure of some p-point generated by a space constructed from our template. (shrink)

We extend the hierarchy of finite-dimensional Ellentuck spaces to infinite dimensions. Using uniform barriers [Formula: see text] on [Formula: see text] as the prototype structures, we construct a class of continuum many topological Ramsey spaces [Formula: see text] which are Ellentuck-like in nature, and form a linearly ordered hierarchy under projections. We prove new Ramsey-classification theorems for equivalence relations on fronts, and hence also on barriers, on the spaces [Formula: see text], extending the Pudlák–Rödl theorem for barriers on the Ellentuck (...) space. The inspiration for these spaces comes from continuing the iterative construction of the forcings [Formula: see text] to the countable transfinite. The [Formula: see text]-closed partial order [Formula: see text] is forcing equivalent to [Formula: see text], which forces a non-p-point ultrafilter [Formula: see text]. This work forms the basis for further work classifying the Rudin–Keisler and Tukey structures for the hierarchy of the generic ultrafilters [Formula: see text]. (shrink)

Given a topological Ramsey space math formula, we extend the notion of semiselective coideal to sets math formula and study conditions for math formula that will enable us to make the structure math formula a Ramsey space and also study forcing notions related to math formula which will satisfy abstract versions of interesting properties of the corresponding forcing notions in the realm of Ellentuck's space. This extends results from to the most general context of topological Ramsey spaces. As applications, we (...) prove that for every topological Ramsey space math formula, under suitable large cardinal hypotheses every semiselective ultrafilter math formula is generic over math formula; and that given a semiselective coideal math formula, every definable subset of math formula is math formula-Ramsey. This generalizes the corresponding results for the case when math formula is equal to Ellentuck's space. (shrink)

We give topological characterizations of filters${\cal F}$onωsuch that the Mathias forcing${M_{\cal F}}$adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzmán, Hrušák, Martínez, Minami, and Tsaban.

If $\mathcal{F}$ is a filter on $\omega$, we say that $\mathcal{F}$ is Canjar if the corresponding Mathias forcing does not add a dominating real. We prove that any Borel Canjar filter is $F_{\sigma}$, solving a problem of Hrušák and Minami. We give several examples of Canjar and non-Canjar filters; in particular, we construct a $\mathsf{MAD}$ family such that the corresponding Mathias forcing adds a dominating real. This answers a question of Brendle. Then we prove that in all the “classical” models (...) of $\mathsf{ZFC}$ there are $\mathsf{MAD}$ families whose Mathias forcing does not add a dominating real. We also study ideals generated by branches, and we uncover a close relation between Canjar ideals and the selection principle $S_{\mathrm{fin}}$ on subsets of the Cantor space. (shrink)

In mathematical practice certain formulas φ are believed to essentially decide all other natural properties of the object x. The purpose of this paper is to exactly quantify such a belief for four formulas φ, namely “x is a Ramsey ultrafilter”, “x is a free Souslin tree”, “x is an extendible strong Lusin set” and “x is a good diamond sequence”.

Henle, Mathias, and Woodin proved in [21] that, provided that${\omega }{\rightarrow }({\omega })^{{\omega }}$holds in a modelMof ZF, then forcing with$([{\omega }]^{{\omega }},{\subseteq }^*)$overMadds no new sets of ordinals, thus earning the name a “barren” extension. Moreover, under an additional assumption, they proved that this generic extension preserves all strong partition cardinals. This forcing thus produces a model$M[\mathcal {U}]$, where$\mathcal {U}$is a Ramsey ultrafilter, with many properties of the original modelM. This begged the question of how important the Ramseyness of$\mathcal (...) {U}$is for these results. In this paper, we show that several classes of$\sigma $-closed forcings which generate non-Ramsey ultrafilters have the same properties. Such ultrafilters include Milliken–Taylor ultrafilters, a class of rapid p-points of Laflamme,k-arrow p-points of Baumgartner and Taylor, and extensions to a class of ultrafilters constructed by Dobrinen, Mijares, and Trujillo. Furthermore, the class of Boolean algebras$\mathcal {P}({\omega }^{{\alpha }})/{\mathrm {Fin}}^{\otimes {\alpha }}$,$2\le {\alpha }<{\omega }_1$, forcing non-p-points also produce barren extensions. (shrink)

The notion of a [Formula: see text]-generic sequence of P-points is introduced in this paper. It is proved assuming the Continuum Hypothesis that for each [Formula: see text], any [Formula: see text]-generic sequence of P-points can be extended to an [Formula: see text]-generic sequence. This shows that the CH implies that there is a chain of P-points of length [Formula: see text] with respect to both Rudin–Keisler and Tukey reducibility. These results answer an old question of Andreas Blass.

On the occasion of his 70th birthday, the work of Adrian Mathias in set theory is surveyed in its full range and extent.

Let I be an F σ -ideal on natural numbers. We characterize the ultrafilters which are generic over the model L for the poset of I -positive sets of natural numbers ordered by inclusion.