Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
303 views

Weaker versions of Gandy ordinals

Gostanian's paper "The next admissible ordinal" (see https://www.sciencedirect.com/science/article/pii/0003484379900251 ), is concerned with the supremum of the $\alpha$-recursive ordinals for various ...
M Carl's user avatar
  • 365
4 votes
0 answers
253 views

Is this recursion theoretic analogue of a criterion of weakly compact cardinal accurate?

Jensen proved that, if V=L, and $\kappa$ is a regular cardinal, then if for any stationary $A\subseteq \kappa$, the set $\{\alpha\mid A \text{ is stationary below }\alpha\}$ is stationary in $\kappa$, ...
Reflecting_Ordinal's user avatar
4 votes
0 answers
199 views

On the proof of a normal form theorem for ordinal (primitive) recursion

Consider the following statement (which follows easily from various results found in the literature): (†) There exists a primitive recursive (“p.r.”) relation $T$ on the ordinals such that, if $(...
Gro-Tsen's user avatar
  • 32.5k
2 votes
0 answers
235 views

The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals

This question is based on the assumption that all computations start with no ordinal parameters (i.e. the input is empty). The term “stabilization time of a machine” for this question implies the ...
lyrically wicked's user avatar