1985
DOI: 10.1007/bf02761119
|View full text |Cite
|
Sign up to set email alerts
|

Isomorphism types of Aronszajn trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
128
0

Year Published

1991
1991
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(129 citation statements)
references
References 13 publications
1
128
0
Order By: Relevance
“…Over time, this conjecture developed in the folklore and at some point it was known to be equivalent -modulo PFA -to the assertion that the above list forms a basis for the class of uncountable linear orders. 1 Moreover this reduction does not require any of the large cardinal strength of PFA. The reader is referred to the final section of [15] for proofs of the above assertions.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Over time, this conjecture developed in the folklore and at some point it was known to be equivalent -modulo PFA -to the assertion that the above list forms a basis for the class of uncountable linear orders. 1 Moreover this reduction does not require any of the large cardinal strength of PFA. The reader is referred to the final section of [15] for proofs of the above assertions.…”
Section: Introductionmentioning
confidence: 99%
“…A central notion in our analysis is that of the saturation of an Aronszajn tree T -whenever A is a collection of uncountable downward closed subsets of T which have pairwise countable intersection, then A has cardinality at most ω 1 . When possible, 1 The speculation of the consistent existence of a finite basis for the uncountable linear orders seems to have first been made in print in [3], although it still seems to have been unknown at that point that this was equivalent to Shelah's conjecture. 2 The current upper bound is a supercompact cardinal [12].…”
Section: Introductionmentioning
confidence: 99%
“…Our focus in this paper will be to show that the Proper Forcing Axiom (PFA) implies that any uncountable linear order must contain an isomorphic copy of one of the following five orders: X, ω 1 , ω * 1 , C, and C * . Here X is any fixed set of reals of cardinality ℵ 1 and C is any fixed Countryman line.…”
Section: Introductionmentioning
confidence: 99%
“…Theorem 1.1 (PFA, [3] PFA is a strengthening of the Baire Category Theorem and is independent of the usual axioms of set theory. Frequently, as in Baumgartner's result above, this axiom can be used to find morphisms between certain structures or to make other combinatorial reductions (see [1], [3], [7], [24], [25], [27]). An additional assumption is necessary in Baumgartner's result because of the following classical construction of Sierpiński.…”
Section: Introductionmentioning
confidence: 99%
“…The assumptions of the above theorem are known to be consistent in the case " ν = ω " (see [AS85,Theorem 4.1]). If ν is uncountable, then this assumption implies that (κ) fails and κ is weakly compact in L (see [Tod07,Corollary 6.3.3] and [Tod89, Theorem 3]).…”
Section: ])mentioning
confidence: 99%