We classify ultrafilters on ω with respect to sequential contours (see [4].[5]) of different ranks. In this way we obtain an ω1 sequence {Pα}1≤α≤ω1 of disjoint classes. We prove that non-emptiness of Pα for successor α ≥ 2 is equivalent to the existence of P-point. We investigate relations between P-hierarchy and ordinal ultrafilters (introduced by J. E. Baumgartner in [1]), we prove that it is relatively consistent with ZFC that the successor classes (for α ≥ 2) of P-hierarchy and ordinal (...) ultrafilters intersect but are not the same. (shrink)

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.

We study the I-ultrafilters on ω, where I is a collection of subsets of a set X, usually R or ω 1 . The I-ultrafilters usually contain the P-points, often as a small proper subset. We study relations between I-ultrafilters for various I, and closure of I-ultrafilters under ultrafilter sums. We consider, but do not settle, the question whether I-ultrafilters always exist.

We study the $I$-ultrafilters on $\omega$, where $I$ is a collection of subsets of a set $X$, usually $\mathbb{R}$ or $\omega_1$. The $I$-ultrafilters usually contain the $P$-points, often as a small proper subset. We study relations between $I$-ultrafilters for various $I$, and closure of $I$-ultrafilters under ultrafilter sums. We consider, but do not settle, the question whether $I$-ultrafilters always exist.

We investigate mutual behavior of cascades, contours of which are contained in a fixed ultrafilter. This allows us to prove that the class of strict JωωJωω-ultrafilters, introduced by J.E. Baumgartner in [2], is empty. We translate the result to the language of <∞<∞-sequences under an ultrafilter, investigated by C. Laflamme in [17], and we show that if there is an arbitrary long finite <∞<∞-sequence under u , then u is at least a strict Jωω+1Jωω+1-ultrafilter.

An analogue of Mathias forcing is studied in connection of free Boolean algebras and nowhere dense ultrafilters. Some applications to rigid Boolean algebras are given.