e/Higman's lemma

New Query

Information
has glosseng: 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.
lexicalizationeng: Higman's lemma
instance ofc/Lemmas

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2024 Gerard de Melo.   Contact   Legal Information / Imprint