We study the Katětov order on Borel ideals. We prove two structural theorems, one for Borel ideals, the other for analytic P-ideals. We isolate nine important Borel ideals and study the Katětov order among them. We also present a list of fundamental open problems concerning the Katětov order on Borel ideals.

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.

We give a new characterization of the cardinal invariant $\mathfrak {d}$ as the minimal cardinality of a family $\mathcal {D}$ of tall summable ideals such that an ultrafilter is rapid if and only if it has non-empty intersection with all the ideals in the family $\mathcal {D}$. On the other hand, we prove that in the Miller model, given any family $\mathcal {D}$ of analytic tall p-ideals such that $\vert \mathcal {D}\vert <\mathfrak {d}$, there is an ultrafilter $\mathcal {U}$ which (...) is an $\mathscr {I}$ -ultrafilter for all ideals $\mathscr {I}\in \mathcal {D}$ at the same time, yet $\mathcal {U}$ is not a rapid ultrafilter. As a corollary, we obtain that in the Miller model, given any analytic tall p-ideal $\mathscr {I}$, $\mathscr {I}$ -ultrafilters are dense in the Rudin–Blass ordering, generalizing a theorem of Bartoszyński and S. Shelah, who proved that in such model, Hausdorff ultrafilters are dense in the Rudin–Blass ordering. This theorem also shows some limitations about possible generalizations of a theorem of C. Laflamme and J. Zhu. (shrink)

Under the continuum hypothesis we prove that for any tall P-ideal Ionω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{I} \,{\rm on}\,\, \omega}$$\end{document} and for any ordinal γ≤ω1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\gamma \leq \omega_1}$$\end{document} there is an I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{I}}$$\end{document}-ultrafilter in the sense of Baumgartner, which belongs to the class Pγ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_{\gamma}}$$\end{document} of the P-hierarchy of ultrafilters. Since the class (...) of P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_2}$$\end{document} ultrafilters coincides with the class of P-points, our result generalizes the theorem of Flašková, which states that there are I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{I}}$$\end{document}-ultrafilters which are not P-points. (shrink)

James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) his knowledge of set theory to a variety of areas in collaboration with other mathematicians, and he encouraged a community of mathematicians with engaging survey talks, enthusiastic discussions of open problems, and friendly mathematical conversations. (shrink)

A P-point ultrafilter over \(\omega \) is called an interval P-point if for every function from \(\omega \) to \(\omega \) there exists a set _A_ in this ultrafilter such that the restriction of the function to _A_ is either a constant function or an interval-to-one function. In this paper we prove the following results. (1) Interval P-points are not isomorphism invariant under \(\textsf{CH}\) or \(\textsf{MA}\). (2) We identify a cardinal invariant \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})\) such that every filter base (...) of size less than continuum can be extended to an interval P-point if and only if \(\textbf{non}^{**}({\mathcal {I}}_{\tiny {\hbox {int}}})={\mathfrak {c}}\). (3) We prove the generic existence of slow/rapid non-interval P-points and slow/rapid interval P-points which are neither quasi-selective nor weakly Ramsey under the assumption \({\mathfrak {d}}={\mathfrak {c}}\) or \(\textbf{cov}({\mathcal {B}})={\mathfrak {c}}\). (shrink)

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for iterated contours of sequential cascades. A related problem of continuous extension of maps between maximal elements of sequential cascades to full subcascades is solved in full generality.

We investigate cardinal invariants related to the structure of dense sets of rationals modulo the nowhere dense sets. We prove that , thus dualizing the already known [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. 183 59–80, Theorem 3.6]. We also show the consistency of each of and . Our results answer four questions of Balcar, Hernández and Hrušák [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. (...) 183 59–80, Questions 3.11]. (shrink)

We study relations between measure-theoretic classes of ultrafilters, such as the Property M ultrafilters of [4], with other well-known ultrafilter classes. We define several classes of measure theoretic ultrafilters, of which the Property M ultrafilters are the strongest. We show which containments are provable in ZFC between these measure-theoretic ultrafilters and boolean combinations of well-known ultrafilters such as the selective, semi-selective, and P-point ultrafilters. We also list some of the containment results between measure-theoretic ultrafilters and several other ultrafilter classes, such (...) as the Arrow and Property C ultrafilters. (shrink)

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.