Source: wikibot/higman-s-lemma
= Higman's lemma
{wiki=Higman's_lemma}
Higman's lemma is a result in combinatorial mathematics, specifically in the area of order and partially ordered sets (posets). It states that if \\( A \\) is a finite set of words over a finite alphabet, then there exists a finite set of lists (i.e.