Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite sequences
well-quasi-orders |
| gptkbp:field |
gptkb:mathematics
gptkb:order_theory combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Higman's lemma
|
| gptkbp:namedAfter |
gptkb:Graham_Higman
|
| gptkbp:publicationYear |
1952
|
| gptkbp:relatedTo |
gptkb:Dickson's_lemma
Kruskal's tree theorem |
| gptkbp:sentence |
If (A, ≤) is a well-quasi-ordered set, then the set of finite sequences over A is also well-quasi-ordered under the embeddability relation.
|
| gptkbp:statedIn |
Graham Higman's 1952 paper
|
| gptkbp:usedIn |
automata theory
computer science proof theory termination proofs |
| gptkbp:bfsParent |
gptkb:Donald_G._Higman
|
| gptkbp:bfsLayer |
7
|