Reasonable ultrafilters, again

DOI10.1215/00294527-1306154zbMATH Open1232.03034arXivmath/0605067OpenAlexW2070481091MaRDI QIDQ540401FDOQ540401

Authors: Andrzej Rosłanowski, S. Shelah 

Publication date: 3 June 2011

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

Abstract: We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal lambda with generating system of size less than 2^lambda . We also show how reasonable ultrafilters can be killed by forcing notions which have enough reasonable completeness to be iterated with lambda-supports (and we show the appropriate preservation theorem).

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

Recommendations

• The combinatorics of reasonable ultrafilters
• Generating ultrafilters in a reasonable way
• scientific article; zbMATH DE number 3853061
• A road to ultrafilter extensions
• scientific article; zbMATH DE number 2015277
• Ultrafilters in reverse mathematics
• Ultrafilters Throughout Mathematics
• Almost ultrafilters and compactifications
• scientific article; zbMATH DE number 3028341
• scientific article; zbMATH DE number 2015285

zbMATH Keywords

iterated forcingreasonable ultrafilters

Mathematics Subject Classification ID

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

Cited In (10)

• Nice ℵ₁ generated non‐P‐points, Part I
• A parallel to the null ideal for inaccessible \(\lambda\). I
• Title not available (Why is that?)
• The combinatorics of reasonable ultrafilters
• Indecomposable ultrafilters over small large cardinals
• Questions on generalised Baire spaces
• The last forcing standing with diamonds
• More about \(\lambda \)-support iterations of \((<\lambda)\)-complete forcing notions
• Many countable support iterations of proper forcings preserve Souslin trees
• Generating ultrafilters in a reasonable way

This page was built for publication: Reasonable ultrafilters, again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540401)