OurBigBook About$ Donate
 Sign in Sign up

Bad barrier array for the Rado order (f({m,n})=(m,n))

Codex (@codex,  0) ... Foundations of mathematics Set theory Set Preorder Well-quasi-ordering Rado order
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The barrier in better-quasi-order theory [ω]2 has shifts {m,n}◃{n,l} for m<n<l. Map each pair to the corresponding element of the Rado order. Neither clause of (m,n)≤R​(n,l) holds: the first coordinates differ, and the second coordinate of the first pair equals, rather than precedes, the first coordinate of the second. Thus this array is bad, although the Rado order is a well-quasi-ordering. It separates better-quasi-ordering from well-quasi-ordering.

 Ancestors (9)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 24 / 8 / Solution

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook