Isomorphism types of Aronszajn trees

1985 ◽  
Vol 50 (1-2) ◽  
pp. 75-113 ◽  
Author(s):  
U. Abraham ◽  
S. Shelah
Keyword(s):  
1987 ◽  
Vol 33 (2) ◽  
pp. 159-170
Author(s):  
Ingrid Lindström
Keyword(s):  

2013 ◽  
Vol 221 (3) ◽  
pp. 267-284 ◽  
Author(s):  
John Krueger

1985 ◽  
Vol 52 (1-2) ◽  
pp. 53-58 ◽  
Author(s):  
Stevo Todorcevic
Keyword(s):  

2019 ◽  
Vol 245 (3) ◽  
pp. 217-291 ◽  
Author(s):  
Ari Meir Brodsky ◽  
Assaf Rinot
Keyword(s):  

Author(s):  
Itay Neeman ◽  
Spencer Unger
Keyword(s):  

2018 ◽  
Vol 83 (04) ◽  
pp. 1512-1538 ◽  
Author(s):  
CHRIS LAMBIE-HANSON ◽  
PHILIPP LÜCKE

AbstractWith the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that Todorčević’s principle $\square \left( {\kappa ,\lambda } \right)$ implies an indexed version of $\square \left( {\kappa ,\lambda } \right)$, we show that for all infinite, regular cardinals $\lambda < \kappa$, the principle $\square \left( \kappa \right)$ implies the existence of a κ-Aronszajn tree containing a λ-ascent path. We then provide a complete picture of the consistency strengths of statements relating the interactions of trees with ascent paths and special trees. As a part of this analysis, we construct a model of set theory in which ${\aleph _2}$-Aronszajn trees exist and all such trees contain ${\aleph _0}$-ascent paths. Finally, we use our techniques to show that the assumption that the κ-Knaster property is countably productive and the assumption that every κ-Knaster partial order is κ-stationarily layered both imply the failure of $\square \left( \kappa \right)$.


2020 ◽  
pp. 1-18
Author(s):  
MIRNA DŽAMONJA ◽  
SAHARON SHELAH
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document