Reasonably complete forcing notions

Abstract

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.

Cited by in corpus (4)

• More about lambda-support iterations of <lambda-complete forcing notions
• The Higher Cichoń Diagram
• Explicit example of collapsing kappa^+ in iteration of kappa-proper forcings
• A parallel to the null ideal for inaccessible lambda. Part I