Higman's lemma

From Wikipedia, the free encyclopedia

In mathematics, Higman's lemma states that the set of finite sequences over a well-quasi-ordered set of labels is itself well-quasi-ordered. This is a special case of the later Kruskal's tree theorem.

[edit] References

  • Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3), 2(7):326–336, September 1952

[edit] External links

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.