Skip to main content Accessibility help

Well-quasi-orderings and sets of finite sequences

  • Richard Laver (a1)


Section 1 contains a list of the facts about well-quasi-orderings (wqo's) which were established in (1), (4), (7), (10), and (13), with proofs given except for the last three theorems. The theory of well-quasi-orderings is a precursor to Nash–Williams' theory of better-quasi-orderings (10, 11, 12, 6, 7). Section 1 of this paper may be viewed as a beginning to Section 1 of a forthcoming paper, in which an explication of bqo theory is given.



Hide All
(1)Higman, G.Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2 (1952), 326336.
(2)Jenkyns, T. A. and Nash-Williams, C. ST J. A.Counter examples in the theory of wellquasi-ordered sets. Univ. of Waterloo (minimeographed).
(3)Kruskal, J. The theory of well-partially-ordered sets. Thesis. (Princeton, 1954.)
(4)Kruskal, J.Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc. 95 (1960), 210225.
(5)Kruskal, J.The theory of well-quasi-ordering: a frequently discovered concept. J. Combinatorial Theory 13 (1972), 297305.
(6)Laver, R.On Fraissé's order type conjecture. Ann. of Math. 93 (1971), 89111.
(7)Laver, R.An order type decomposition theorem. Ann. of Math. 98 (1973), 96119.
(8)Mader, W.Wohlquasigeordnete Klassen endliche graphen. J. Combinatorial Theory 12 (1972), 105122.
(9)Nash-Williams, C. ST J. A.On well-quasi-ordering finite trees. Proc. Cambridge Philos. Soc. 59 (1963), 833835.
(10)Nash-Williams, C.ST J. A. On well-quasi-ordering tranafinite sequences. Proc. Cambridge Philos. Soc. 61 (1965), 3339.
(11)Nash-Williams, C.ST J. A. On well-quasi-ordering infinite trees. Proc. Cambridge Philos. Soc. 61 (1965), 697720.
(12)Nash-Williams, C. ST J. A.On better-quasi-ordering transfinite sequences. Proc. Cambridge Philos. Soc. 64 (1968), 273290.
(13)Rado, R.Partial well ordering of sets of vectors. Mathematika 1 (1954), 8995.
(14)Watkins, M. E.A theorem on Tait colorings with an application to the generalized Petersen graphs. J. Combinatorial Theory 6 (1969), 152164.


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed