A bad sequence in a preorder is an infinite sequence with no indices satisfying . A preorder is a well-quasi-ordering precisely when no such sequence exists.
A minimal bad sequence chooses each successive object of least possible natural-number size among choices that admit an infinite bad continuation of the already fixed prefix. Replacing its next object by a strictly smaller one cannot leave a bad sequence. This contradiction principle proves Higman lemma and the labelled version of Kruskal's tree theorem.

Ancestors (8)

  1. Well-quasi-ordering
  2. Preorder
  3. Set
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version