Reasonable ultrafilters, again

DOI10.1215/00294527-1306154zbMath1232.03034arXivmath/0605067OpenAlexW2070481091MaRDI QIDQ540401

Saharon Shelah, Andrzej Rosłanowski

Publication date: 3 June 2011

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0605067

zbMATH Keywords

iterated forcingreasonable ultrafilters

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items (7)

More about \(\lambda \)-support iterations of \((<\lambda)\)-complete forcing notions ⋮ Many countable support iterations of proper forcings preserve Souslin trees ⋮ Nice ℵ₁ generated non‐P‐points, Part I ⋮ Generating ultrafilters in a reasonable way ⋮ A parallel to the null ideal for inaccessible \(\lambda\). I ⋮ The last forcing standing with diamonds ⋮ Questions on generalised Baire spaces

This page was built for publication: Reasonable ultrafilters, again