Higman's lemma

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.


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

External links

Search another word or see Higman's_lemmaon Dictionary | Thesaurus |Spanish
Copyright © 2015, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature