Reasonable ultrafilters, again

Andrzej Roslanowski*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in previous work by Shelah. We introduce stronger properties of ultrafilters and we show that those properties may be handled in λ-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating systems of size less than 2 λ. We also show how ultrafilters generated by small systems can be killed by forcing notions which have enough reasonable completeness to be iterated with λ-supports.

Original languageEnglish
Pages (from-to)113-147
Number of pages35
JournalNotre Dame Journal of Formal Logic
Volume52
Issue number2
DOIs
StatePublished - 2011

Keywords

  • Iterated forcing
  • Reasonable ultrafilters

Fingerprint

Dive into the research topics of 'Reasonable ultrafilters, again'. Together they form a unique fingerprint.

Cite this