5
votes
0answers
55 views

Raising a partial function to the power of an ordinal

Consider a set $X$, and let $f : X \rightarrow X$ denote a partial function. Then for natural $n$, we can define $f^n$ as iterated composition, e.g. $f^2 = f \circ f$. Now suppose that $X$ is also ...
5
votes
2answers
254 views

The order type of the rationals.

Herewith another mind-numbingly naive question from a reader of philosophy. My question concerns the order type of the rational numbers. Omega squared seems a natural first choice, but obviously ...
2
votes
2answers
81 views

Definition of ordinals in Grothendieck toposes

What is a useful definition of an ordinal in Grothendieck toposes. Useful in this context means that I would like to construct fixed points of monotone maps on complete lattices using iteration from ...
2
votes
1answer
82 views

Are the closed ordinals (apart from $0$ and $1$) precisely the regular cardinals?

Given a partially ordered set $P$, a collection of partially ordered sets, call it $\mathcal{Q}$, and an arbitrary function $f : P \rightarrow \mathcal{Q},$ we can form a new partially ordered set ...
7
votes
1answer
137 views

When the ordinal sum equals the Hessenberg (“natural”) sum

Let $\alpha_1 \geq \ldots \geq \alpha_n$ be ordinal numbers. I am interested in necessary and sufficient conditions for the ordinal sum $\alpha_1 + \ldots + \alpha_n$ to be equal to the Hessenberg ...
4
votes
0answers
51 views

Nimber of selective compound games

Background/Definitions. Let $\alpha,\beta$ ordinal numbers. The Hessenberg sum $\alpha \# \beta$ is defined recursively as the smallest ordinal which is $>\alpha' \# \beta$ and $> \alpha \# ...
6
votes
2answers
190 views

Confusion about cofinality

I'm confused about the notion of the cofinality of a cardinal. Since I think the source of the confusion is the Von Neumann cardinal assignment, my first question is: Question 0. Is there an article ...
14
votes
1answer
334 views

Is there an axiomatic approach to ordinal arithmetic?

I've always wondered, is there an axiomatic approach to the arithmetic of ordinal numbers? If so, I imagine it would be on par with set theory in terms of its proof-theoretic strength.
6
votes
1answer
152 views

What are these operations on ordinals, analogous to multichoose, called?

Given well-ordered sets $\alpha$ and $\beta$, define $\left(\!\!{\alpha\choose \beta}\!\!\right)$ to be the set of weakly decreasing functions from $\beta$ to $\alpha$, ordered lexicographically; this ...
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 ...