Well-quasi-ordering

A well-quasi-ordering on a set is a quasi-ordering (i.e., a reflexive, transitive binary relation) such that any infinite sequence of elements, … from contains an increasing pair ≤ with <. The set is said to be well-quasi-ordered, or shortly wqo.