On operations and linear extensions of well partially ordered sets

Order

Volumn 21, Issue 1, 2004, Pages 7-17

  Malicki, Maciej ^a,b   Rutkowski, Aleksander ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Antichain; Linear extension; Ordered set; Partially well order; Rank; Tree; Well founded order; Width

Indexed keywords

EID: 12944268304     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11083-004-2738-0     Document Type: Article

References (12)

1. Bollerhoff, U.: On well-quasi-ordering finite sequences, Europ. J. Combin. 10 (1989), 227-230.
2. Erdos, P. and Rado, R.: Sets having divisor property, solution to problem 4358, Amer. Math. Monthly 59 (1952), 255-257.
3. Higman, G.: Ordering by divisibility in abstract algebras, Proc. London Math. Soc. (3) 2 (1952), 326-336.
4. de Jongh, D. H. J. and Parigh, R.: Well-partial orderings and hierachies, Indigationes Math. 39 (1979), 195-207.
5. Kruskal, J. B.: Well-quasi-ordering, the tree theorem, and Vasonyi's conjecture, Trans. Amer. Math. Soc. 95 (1960), 210-225.
6. Kruskal, J. B.: The theory of well-quasi-ordering: a frequently discovered concept, J. Combin. Theory (A) (1972), 297-305.
7. Milner, E. C. and Sauer, N.: On chains and antichains in well founded partially ordered sets, J. London Math. Soc. (2) 24 (1981), 15-33.
8. Neumann, B. H.: On ordered division rings, Trans. Amer. Math. Soc. 66 (1949), 202-346.
9. Rutkowski, A.: Which countable ordered sets have a dense linear extension? Math. Slovaca 46(5) (1996), 445-455.
10. Schmidt, D.: The relation between the height of a well-founded partial ordering and the order types of its chains and antichains, J. Combin. Theory Ser. B 31 (1981), 183-189.
11. Weiermann, A.: Complexity bounds for some finite forms in Kruskal's theorem, J. Symbolic Comput. 18 (1994), 463-488.
12. Wolk, E. S.: Partially well ordered sets and partial ordinals, Fund. Math. 60 (1967), 175-186.