Iteration of \(\lambda\)-complete forcing notions not collapsing \(\lambda^+\) (Q1599773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1751288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration of \(\lambda\)-complete forcing notions not collapsing \(\lambda^+\) |
scientific article; zbMATH DE number 1751288 |
Statements
Iteration of \(\lambda\)-complete forcing notions not collapsing \(\lambda^+\) (English)
0 references
31 March 2003
0 references
The paper continues the development of a theory which is parallel to the theory of proper forcing notions in countable support iterations for iterations with larger supports. The authors introduce definitions of properties of forcing notions (including properness over a cardinal \(\lambda\)) and prove a preservation theorem for forcing iterations with \(<\lambda^+\) support. They give three examples of forcing notions having the introduced properties (one of them is a relative of Baumgartner's forcing for adding a club to \(\aleph_1\)). The paper is concluded by a discussion on application to forcing axioms and some variants of the definitions.
0 references
\(D\)-diamond sequence
0 references
proper forcing over \((D,\mathcal S)\)-semi-diamonds
0 references
proper forcing over \(\lambda\)
0 references
\(<\lambda^+\)-support iteration
0 references
0.879658043384552
0 references
0.8399787545204163
0 references
0.8319960832595825
0 references
0.8216233849525452
0 references
