2026/08/03 by Jakub Smolík
Mathematics · #math.LO
7 pages
arxiv created 2026/08/03 · arxiv updated 2026/08/04
Assuming the axiom of choice, we show that a weakened version of Nash-Williams' theorem about infinite trees can be recovered while completely avoiding better-quasi-orderings. In particular, we give a direct proof that the class of all order-theoretic trees is well-quasi-ordered by the tree-homomorphism relation.