Iteration of \(\lambda\)-complete forcing notions not collapsing \(\lambda^+\) (Q1599773): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: math/9906024 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2114227383 / rank | |||
Normal rank |
Latest revision as of 10:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iteration of \(\lambda\)-complete forcing notions not collapsing \(\lambda^+\) |
scientific article |
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