On the bounding, splitting, and distributivity numbers

Alan Dow, Saharon Shelah

Research output: Contribution to journalArticlepeer-review

Abstract

The cardinal invariants h, b, s of P(ω) are known to satisfy that ω1 ≤ h ≤ min{b, s}. We prove that all inequalities can be strict. We also introduce a new upper bound for h and show that it can be less than s. The key method is to utilize finite support matrix iterations of ccc posets following paper Ultrafilters with small generating sets by A. Blass and S. Shelah (1989).

Original languageEnglish
Pages (from-to)331-351
Number of pages21
JournalCommentationes Mathematicae Universitatis Carolinae
Volume64
Issue number3
DOIs
StatePublished - 2023

Bibliographical note

Publisher Copyright:
© (2023), (Charles University, Faculty of Mathematics and Physics). All rights reserved.

Keywords

  • cardinal invariants of the continuum
  • matrix forcing

Fingerprint

Dive into the research topics of 'On the bounding, splitting, and distributivity numbers'. Together they form a unique fingerprint.

Cite this