English

Laver ultrafilters

Logic 2026-02-03 v1

Abstract

We introduce Laver ultrafilters\textit{Laver ultrafilters}, namely ultrafilters U\mathcal{U} for which the associated Laver forcing LU\mathbb{L}_{\mathcal{U}} has the Laver property. We give simple combinatorial characterisations of these ultrafilters, which allow us to analyse their position among several well-studied combinatorial classes, including PP-points, rapid ultrafilters, and ultrafilters arising in Baumgartner's I\mathcal{I}-ultrafilter framework. In particular, we show that the class of Laver ultrafilters properly contains the class of rapid PP-points and that it is properly contained both in the class of hereditarily rapid- and in the class of measure zero ultrafilters. Finally, we investigate the (generic) existence of Laver ultrafilters and establish bounds on their generic existence number. In particular, we show that it is consistent that PP-points do not exist while Laver ultrafilters exist generically.

Keywords

Cite

@article{arxiv.2602.01478,
  title  = {Laver ultrafilters},
  author = {Silvan Horvath and Tan Özalp},
  journal= {arXiv preprint arXiv:2602.01478},
  year   = {2026}
}
R2 v1 2026-07-01T09:30:37.283Z