Reasonably complete forcing notions

Details Reasonably complete forcing notions Reasonably complete forcing notions

2005-08-16

arxiv.org/abs/math/0508272v1

Mathematics

Logic

Scientific paper

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on lambda are distinct.

Affiliated with

Also associated with

No associations

Rating

Reasonably complete forcing notions 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 Reasonably complete forcing notions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasonably complete forcing notions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131456