well-quasi-ordering
Sign in to saveAlso known as wqo, Well-quasi-ordered
In mathematics, specifically order theory, a well-quasi-ordering or wqo on a set X is a quasi-ordering of X for which every infinite sequence of elements x_0, x_1, x_2, \ldots from X contains a non-decreasing pair x_i \leq x_j with i
Wikidata facts
- Subclass of
- preorder
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~10 min read
Encyclopedic overview
12 sectionsContents
- Motivation
- Formal definition
- Ordinal type
- Examples
- Constructing new wpo's from given ones
- Wqo's versus well partial orders
- Infinite increasing subsequences
- Properties of wqos
- See also
- Notes
- References
- Further reading
In mathematics, specifically order theory, a well-quasi-ordering or wqo on a set X is a quasi-ordering of X for which every infinite sequence of elements x_0, x_1, x_2, \ldots from X contains a non-decreasing pair x_i \leq x_j with i
==Motivation==
Excerpted from Wikipedia’s “well-quasi-ordering” article, available under the CC BY-SA 4.0 licence.