OurBigBook About$ Donate
 Sign in Sign up

Shuffle bound for ordinal partitions

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Ordinal Hessenberg natural sum
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
If a well-order is the union of suborders of types ξ and η, its type is at most ξ#η.
  • Table of contents
    • Ordinal partition bound Shuffle bound for ordinal partitions

Ordinal partition bound

 0  0
Shuffle bound for ordinal partitions
If an ordinal is partitioned into two copies of type β, its type is below β+β+β; two copies do not always give a strict bound.

 Ancestors (7)

  1. Hessenberg natural sum
  2. Ordinal
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 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