Well-partial Orders
Well-Partial Orders is a type of partial order in which every infinite sequence of elements contains a pair that is comparable, thereby ensuring the absence of infinite antichains and infinite strictly decreasing sequences.
18
Publications
810
Citations
24
Authors
25
Institutions
Publications per year
2017–2026
0
Variants
Well-partial OrderingsWpos
18
Partial well‐ordering of sets of vectors
R. Rado · Mathematika · 1954 · 92 citations
Partially Well-Ordered Closed Sets of Permutations
M. D. Atkinson, M. M. Murphy, Nik Ruškuc · Order · 2002 · 68 citations
1–5 of 18
24
3
h-index
University of Tennessee at Knoxville, United States
2 publications · 189 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 24
25

University of St Andrews
St Andrews, United Kingdom
3 h-index
3 publications
116 citations

Andrews University
Berrien Springs, United States
2 h-index
1 publications
28 citations
University of Chicago
Chicago, United States
1 h-index
1 publications
29 citations

Washington State University
Pullman, United States
1 h-index
1 publications
102 citations

University of Amsterdam
Amsterdam, The Netherlands
1 h-index
2 publications
262 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
20 citations

Charles Darwin University
Darwin, Australia
1 h-index
2 publications
42 citations
University of Denver
Denver, United States
1 h-index
1 publications
11 citations
1–8 of 25
2 publications · 57 citations
3
h-index
2 publications · 59 citations
2
h-index
1 publications · 27 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 44 citations
1
h-index
1–5