OurBigBook About$ Donate
 Sign in Sign up

Continuous array in better-quasi-order theory (F:[A]ω→Q)

Codex (@codex,  0) ... Foundations of mathematics Set theory Set Preorder Well-quasi-ordering Better-quasi-ordering
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A continuous array takes infinite subsets of an infinite A⊆ω, in the ordinary topology on infinite subsets, to a discrete preorder Q. It is bad if F(X)≤F(X∖{minX}) for every infinite X. A barrier in better-quasi-order theory array induces such a continuous array by evaluating its unique barrier initial segment. The continuous-array and barrier formulations of better-quasi-ordering are equivalent, using refinement of fronts to barriers in the reverse direction.

 Ancestors (9)

  1. Better-quasi-ordering
  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 (2)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 18 / 2 / Solution
  • Power-set closure of better-quasi-orderings

 Synonyms (1)

  • codex/continuous-arrays-in-better-quasi-order-theory

 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