e/Kruskal's tree theorem

Information
has gloss	eng: In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered (under homeomorphic embedding). The theorem was proved by , and a short proof was given by .
lexicalization	eng: Kruskal's tree theorem
instance of	c/Trees (graph theory)