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
Like
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
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)
Hessenberg natural sum
Ordinal
Set theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
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