0
votes
2answers
57 views

Ordinal existence

Is there any ordinal $\alpha$ such that $\omega ^ {\omega ^ \alpha} = \alpha$? Could you please suggest me how to even try to solve this?
3
votes
1answer
69 views

The order-theoretic structure of the ordinal numbers in non-standard models

I have read the following. Proposition. Let $T$ denote the first-order theory of $\mathbb{N}$ in the language of arithmetic. Then any countable non-standard model of $T$ is order isomorphic to a ...
0
votes
1answer
76 views

Order type of standard models of arithmetic

The standard model of PA has order type $\omega$. By compactness PA has a model of order type $\omega+n$ for any $n$, since every finite subset of the following set of statements is provable: ...
2
votes
1answer
63 views

A representation of well-orderings?

Is there a well-ordering $P$ of the set of real numbers $\mathbb{R}$ such that there is NO function $f: \mathbb{R}->\mathbb{R}$ satisfying the property: for all $x,y \in \mathbb{R}$, $xPy$ iff ...
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 ...
5
votes
1answer
142 views

What is the proof-theoretic ordinal of the first-order theory of real closed fields?

I recently asked a question on MathOverflow, concerning a predicative second-order theory of real numbers. Now the standard way of developing predicativity in the case of second-order arithmetic is ...
3
votes
3answers
117 views

Set $A$ has the cardinality of $\aleph_0$. Prove some properties of partial order $ \langle \mathcal P (A), \subseteq \rangle$.

I try to solve the following task: Set $A$ has the cardinality of $\aleph_0$. The truth is that in the partial order $ \langle \mathcal P (A), \subseteq \rangle$: (answer true or false) a) ...
8
votes
2answers
213 views

Ordinal interpretation of Friedman's $n$?

I heard that Kruskal's tree theorem can be turned into a finite form that creates an extremely fast growing function because ordinals could be encoded into trees. On this wiki page it mentions that ...
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 ...
8
votes
1answer
139 views

what does it mean that constructible universe is definable from ordinals?

I know how constructible universe is created, but I also separatedly read that the universe is definable from ordinals - so I am wondering what it really means.
1
vote
2answers
249 views

What is the cardinality of the countable ordinals?

Every countable ordinal $\alpha$ can be written uniquely in Cantor canonical form as a finite arithmetical expression, say $C(\alpha)$. We thus have the 1-1 correspondence between the countable ...
3
votes
1answer
101 views

An infinite cardinal agrees with all its well-orders on sets of full size.

Suppose $\kappa$ is an infinite von Neumann cardinal (well ordered by $\in$), and take ${<}$ a well-order on $\kappa$. Does there necessarily exists a subset $X\subset\kappa$ of full size (in ...
0
votes
2answers
177 views

Other ways of proving that the set of all countable ordinals is uncountable

I know that the standard way of proving that the set of all countable ordinals is uncountable is by stating that if the set is countable, then it incurs Burali-Forti paradox. Is there other ways of ...
4
votes
3answers
223 views

A set that is not an ordinal

According to what I heard of, an ordinal is constructed by taking an union of {$\alpha$} $\cup$ $\alpha$ where $\alpha$ is a predecessor ordinal. If so, how can there be a set that is not an ...
1
vote
2answers
209 views

How does one prove that there are uncountable number of countable ordinals? [duplicate]

Possible Duplicate: Uncountability of countable ordinals How does one prove that there are uncountable number of countable ordinals? Obviously, there are equal to or more than countable ...
3
votes
1answer
300 views

How to prove that Cantor's normal form can produce all ordinal numbers

How do we prove Cantor's normal form can produce all ordinal numbers? Also, it's a bit difficult to picture $\omega_1$ as a format in Cantor's normal form. Can anyone show how to do this?
2
votes
2answers
185 views

How to prove that $\epsilon_0$ exists?

How do we prove that $\epsilon_0$ exists? The definition of $\epsilon_0$ says that $\omega^{\epsilon_0} = \epsilon_0$. So, how do we know whether such number exists?
6
votes
2answers
295 views

How to define countability of $\omega^{\omega}$ and $\omega_1$? in set theory?

How is the ordinal $\omega_1$ defined? I know that it is a supremum of all smaller ordinals, but then $\omega^\omega$ is also a supremum of all smaller ordinals. How can we distinguish these two ...
6
votes
1answer
143 views

Admissible ordinals…

a little question about admissible sets: Is every $\mathfrak{M}$-admissible ordinals an admissible ordinal ? where $\mathfrak{M}$ is a $L$-structure over $L=\{R_1,\dots,R_k \}$. Thanks.
8
votes
1answer
253 views

Definable order types without infinity axiom.

Denote by $ZF^\times$ the theory of $ZF$ without the axiom of infinity. We know that $V_\omega$, the set of all hereditarily finite sets in a model of $ZF$, is a model of $ZF^\times$. We further know ...
0
votes
1answer
185 views

Formula defining the first transfinite ordinal $\omega$

Just as an exercise in formula manipulation, I tried to find the simplest formula $\phi(x)$ with one free variable $x$ in the language of ZFC that defines the first transfinite ordinal $\omega$ (i.e. ...
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 ...
1
vote
1answer
216 views

About a ordinal-based definition of fast-growing functions

I try to understand the Löb-Wainer-hierarchy and one definition just doesn't open. I hope someone could clarify this to me. A fundamental sequence to limit ordinal $\alpha$ is $\omega$-sequence ...