Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
2 answers
489 views

Mapping between Notations

$\DeclareMathOperator{\address}{address}$ As in my other question, it is assumed that the (total) function describing a given notation is denoted as $\address:p \rightarrow \Bbb{N}$ and assumed to be ...
SSequence's user avatar
  • 881
13 votes
1 answer
650 views

About primitively recursively recognizable ordinals

Preliminary: I believe the notion of primitive recursive functions on ordinals is standard and unproblematic (the main difference with the finite case is that one needs to introduce a $\sup$ or $\...
Gro-Tsen's user avatar
  • 32.5k
17 votes
7 answers
2k views

Finding the largest integer describable with a string of symbols of predefined length

(This question is motivated by the reading of the article Large numbers and unprovable theorems by Joel Spencer, which can be found at http://mathdl.maa.org/images/upload_library/22/Ford/Spencer669-...
Jose Brox's user avatar
  • 2,992
6 votes
1 answer
571 views

Parameter-free effective cardinals

In the paper "Effective cardinals and determinacy in third order arithmetic" by Juan Aguilera, effective cardinals is defined. I'm curious about its little variation, parameter-free ...
Reflecting_Ordinal's user avatar