Reasonable ultrafilters, again

Details Reasonable ultrafilters, again Reasonable ultrafilters, again

2006-05-02

arxiv.org/abs/math/0605067v2

Mathematics

Logic

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Reasonable ultrafilters, again does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reasonable ultrafilters, again, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasonable ultrafilters, again will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184481