OurBigBook About$ Donate
 Sign in Sign up

Eventual dominance in a fast-growing hierarchy (α<β⟹Fα​(n)<Fβ​(n) eventually)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Ordinal Ordinal arithmetic Fast-growing hierarchy
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For the standard fundamental sequences of limit ordinals below epsilon zero, the index order corresponds to eventual, rather than necessarily pointwise, growth. For example, under ω[n]=n+1 and successor iteration n+1 times, Fω​(1)=F2​(1)=7 whereas F3​(1)=2047. Limit stages are diagonal choices, so a larger index can give a smaller value at small arguments.

 Ancestors (8)

  1. Fast-growing hierarchy
  2. Ordinal arithmetic
  3. Ordinal
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 18 / 5 / 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