Well-quasi-ordering infinite trees by homomorphisms
Jakub Smolík
Abstract
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.
Create a lesson
Related papers
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski
Coding is non-robust
Sam Sanders
Scott topologies on products of countable complete Heyting algebras
Xiaoquan Xu
1-genericity and almost everywhere domination
Xuanheng Zhao
Almost-everywhere computation of weak generics relative to r.e. sets
Xuanheng Zhao
On definable Galois theory and definable Galois cohomology in the totally transcendental setting
David Meretzky