2017
DOI: 10.4064/fm224-11-2016
|View full text |Cite
|
Sign up to set email alerts
|

Ascending paths and forcings that specialize higher Aronszajn trees

Abstract: In this paper, we study trees of uncountable regular heights containing ascending paths of small width. This combinatorial property of trees generalizes the concept of a cofinal branch and it causes trees to be non-special not only in V, but also in every cofinality-preserving outer model of V. Moreover, under certain cardinal arithmetic assumptions, the non-existence of such paths through a tree turns out to be equivalent to the statement that the given tree is special in a cofinality preserving forcing exten… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
36
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 14 publications
(37 citation statements)
references
References 27 publications
1
36
0
Order By: Relevance
“…Such trees are even harder to specialize, since ℱ fin θ projects to ℱ bd µ for all infinite cardinals µ θ , and so a model in which such a λ + -tree becomes special would have to satisfy cf(λ) = cf(µ) for all infinite cardinals µ θ . On a dual front, Lücke [Luc17] proved that assuming λ <λ = λ, any λ + -tree with the property that for all infinite θ < λ, the tree admits no ℱ θ -ascent path, can be made special via a cofinality-preserving notion of forcing. That is, the tree is specializable.…”
Section: Introductionmentioning
confidence: 99%
“…Such trees are even harder to specialize, since ℱ fin θ projects to ℱ bd µ for all infinite cardinals µ θ , and so a model in which such a λ + -tree becomes special would have to satisfy cf(λ) = cf(µ) for all infinite cardinals µ θ . On a dual front, Lücke [Luc17] proved that assuming λ <λ = λ, any λ + -tree with the property that for all infinite θ < λ, the tree admits no ℱ θ -ascent path, can be made special via a cofinality-preserving notion of forcing. That is, the tree is specializable.…”
Section: Introductionmentioning
confidence: 99%
“…Note that this shows that trees containing ascent paths are non-special in a very absolute way, because it implies that they remain non-special in every outer model of V in which µ and µ + remain cardinals and cof(λ) = cof(µ) holds. This result was later strengthened by Todorčevic and Torres Pérez in [26] and by the second author in [17] (see Lemma 2.6).…”
Section: Introductionmentioning
confidence: 74%
“…With the help of a result form [17], it is easy to see that the conclusion of Theorem 1.3 implies that κ is a weakly compact cardinal in L. Proof. Assume, towards a contradiction, that there is a (κ)-sequence C and let T = T(ρ C 0 ) denote the tree of full codes of walks through C defined in [24, Section 1] (as in the proof of Theorem 3.5).…”
Section: Consistency Results For Treesmentioning
confidence: 99%
See 2 more Smart Citations