Kruskal's tree theorem
From Wikipedia, the free encyclopedia
In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered. The theorem was proved in 1960 by Joseph Kruskal and is named after him.
[edit] References
- Kruskal, J. B. (May 1960). "Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture". Transactions of the American Mathematical Society 95 (2): 210–225.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
