higmans_lemma (258B)
1 # Higman's lemma 2 3 The [words] on a finite [alphabet] are [well_quasi_ordered] by the [subsequence] [relation] 4 5 Of course this does not work with the [subword] [relation], e.g., a b* c 6 7 Up: [lemma], [word_combinatorics] 8 9 See also: [language_downwards_closed]