Name
Abstract | ||
|---|---|---|
We characterize the tree of functions with finite support in terms of definability. This turns out to have various applications: a new kind of tree dichotomy for ω 1 on the one hand. On the other hand, we prove a reflection principle for trees on ω 2 under SPFA. This reflection of trees implies stationary reflection. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0168-0072(03)00053-8 | Ann. Pure Appl. Logic |
Keywords | DocType | Volume |
Reflection principles,03E47,Coherent trees,03E05,Aronszajn-trees | Journal | 124 |
Issue | ISSN | Citations |
1 | Annals of Pure and Applied Logic | 1 |
PageRank | References | Authors |
0.46 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernhard König | 1 | 44 | 5.84 |