Information | |
---|---|
has gloss | eng: In mathematics, Higmans 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 Kruskals tree theorem. |
lexicalization | eng: Higman's lemma |
instance of | c/Lemmas |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint