3
votes
1answer
107 views

When does $f_{\omega+1}$ catch up the $G_n$-sequence?

Which is the minimal number k, so that $f_{\omega+1}(n) > G_n$ is true for all $n\ge k$ ? For the definition of $f_{\omega+1}$ look at wikipedia fast growing hierarchy $G_n$ is defined by ...
1
vote
0answers
49 views

How many omegas are there in $\large f_{\epsilon_0}$?

For a description look at fast growing hierarchy at wikipedia. $\large f_{\epsilon_0}$ is not defined any more, it is a power tower of omegas, but how many omegas ? I found a defition $$\large ...
3
votes
1answer
44 views

Well ordered Set with $\le$ order type

Let $(x,\le)$ be well-ordered set and let $f: \ x \rightarrow x$ be monotonically increasing function. Prove that $\forall a \in x$ $$a \le f(a)$$ Find an example of set x linearly ...
2
votes
1answer
56 views

Functions from ordinals to ordinals

I'm trying to solve this problem, which appears in Schimmerling's "A Course in Set Theory." Problem. Find two functions $$f:\omega\rightarrow\omega\cdot2$$ and ...
1
vote
1answer
184 views

Is there a general explicit way to construct bijections between countable ordinals?

Is there a general - and possibly easy! - explicit way to "create" bijective functions between countable ordinals? I mean for example a bijection between $\omega$ and $\omega+\omega$, or a bijection ...
5
votes
1answer
187 views

How do we justify functions on the Ordinals

In ZFC there seem to be two ways to define a function, as an ordered triple of domain, codomain and the set of ordered pairs that make its graph, or a relation over the two sets. Whichever we use ...