4
votes
1answer
81 views

Is the ordinal $\omega \uparrow^\omega \omega$ still recursive?

In this question, a very large countable ordinal $\omega \uparrow^\omega \omega$ is defined. Is this ordinal still recursive?
2
votes
1answer
92 views

Is the Church-Kleene Ordinal describable with Kleene's $O$?

Kleene's $O$ is an ordinal notation system that uses certain natural numbers to represent transfinite ordinals. It is a recursive notation system (although it's not decidable whether a number ...
4
votes
1answer
73 views

Is ordinal analysis a non-recursive project?

A recursive ordinal is an ordinal that is the order-type for some recursive relation (i.e. a recursive well-ordering). We can represent recursive ordinals as natural numbers using Kleene's $O$, an ...
2
votes
2answers
88 views

$\omega_1^{CK} - \omega$ - infinite or finite set? And boundary

I am curious whether $\omega_1^{CK} - \omega$ would result in a finite set or infinite set. Does anyone know what happens? Edit: OK, let me add one more question: Suppose that we take $\omega \cdot ...
3
votes
0answers
184 views

How to derive Church-Kleene ordinal

Crossing-out: (How does one prove the existence of Church-Kleene ordinal? Also, why is it labeled as $\omega_1^{CK}$? And why is it first ordinal not hyperarithmetical, and is the first admissible ...
4
votes
2answers
149 views

Ordinals definable over $L_\kappa$

Suppose $\kappa$ is an uncountable cardinal, with $L_\kappa$ an admissible set (i.e. a model of Kripkeā€“Platek set theory). Let $<_\gamma \subseteq \kappa \times \kappa$ denote a wellordering of ...
5
votes
2answers
93 views

Can we implement $\omega^{CK}_1$ using $\omega^{CK}_1+1$ as an oracle?

Let $\omega^{CK}_1$ denote the least non-recursive ordinal. Suppose we have an unknown well-ordering of $\mathbb{N}$ of the order type $\omega^{CK}_1+1$ as an oracle. Is it possible to write an ...
7
votes
2answers
190 views

Complexity of the set of computable ordinals

According to http://en.wikipedia.org/wiki/Analytical_hierarchy The set of all natural numbers which are indices of computable ordinals is a $\Pi^1_1$ set which is not $\Sigma^1_1$. However, "the ...