Author:
Nash-Williams C. St. J. A.
Abstract
AbstractA new and simple proof is given of the known theorem that, if T1, T2,… is an infinite sequence of finite trees, then there exist i and j such that i < j and Ti is homeomorphic to a subtree of Tj.
Publisher
Cambridge University Press (CUP)
Reference2 articles.
1. Ordering by Divisibility in Abstract Algebras
2. Well-quasi-ordering, the tree theorem, and Vázsonyi's conjecture;Kruskal;Trans. American Math. Soc,1960
Cited by
156 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dot-depth three, return of the J-class;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Well-quasi-ordering and Embeddability of Relational Structures;Order;2024-04
3. Well Partial Orders;Outstanding Contributions to Logic;2024
4. Well ordering principles for iterated $$\Pi ^1_1$$-comprehension;Selecta Mathematica;2023-10-12
5. Bachmann–Howard derivatives;Archive for Mathematical Logic;2022-10-26