# Well-quasi-orderings and sets of finite sequences

@inproceedings{Laver1976WellquasiorderingsAS, title={Well-quasi-orderings and sets of finite sequences}, author={Richard Laver}, year={1976} }

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.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 20 CITATIONS

## Dickson's Lemma, Higman's Theorem and Beyond: a survey of some basic results in order theory

VIEW 1 EXCERPT

CITES BACKGROUND

## Analysis of a Double Kruskal Theorem

VIEW 1 EXCERPT

CITES BACKGROUND

## Laver and set theory

VIEW 2 EXCERPTS

CITES BACKGROUND

## Better-quasi-orders : extensions and abstractions

VIEW 1 EXCERPT

CITES BACKGROUND

## Forbidden substructures and combinatorial dichotomies: WQO and universality

VIEW 1 EXCERPT

CITES BACKGROUND