On better quasi-ordering countable trees

Abstract The main result is that the class of countable trees is better-quasi-ordered under embeddability. R. Laver proved before that a certain class of well-founded trees is b.q.o. Actually our better-quasi-ordered class is larger than the countable class but does not contain Suslin like-trees nor certain Galvin trees of height ω + 1.

[1]  C. St. J. A. Nash-Williams,et al.  On better-quasi-ordering transfinite sequences , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  C. Nash-Williams.  On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4]  Richard Laver,et al.  On Fraisse's order type conjecture , 1971 .

[5]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[6]  C. St. J. A. Nash-Williams,et al.  On well-quasi-ordering transfinite sequences , 1965, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Richard Laver,et al.  An Order Type Decomposition Theorem , 1973 .