On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited (Q2724997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited |
scientific article; zbMATH DE number 1618572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited |
scientific article; zbMATH DE number 1618572 |
Statements
2 December 2001
0 references
order topologies
0 references
infinite trees
0 references
0.89452636
0 references
0.88674283
0 references
0 references
0.8720613
0 references
0.8706729
0 references
0.8690258
0 references
On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited (English)
0 references
This paper gives a new proof of a result of Nash-Williams stating that the infinite trees are well-quasi-ordered. By combining several ideas, especially topological ideas (Ellentuck topology), the author gives a proof both shorter and self-contained.NEWLINENEWLINENEWLINEThe article is well written, nevertheless it suffers of a lack of clarity of both Ellentuck topology and Ramsey theory.
0 references
