Representation of the ordinal numbers up to ω^{ω}. Each turn of the spiral represents one power of ω
In set theory, an ordinal number, or just ordinal, is the order type of a wellordered set. They are usually identified with hereditarily transitive sets. Ordinals are an extension of the natural numbers different from integers and from cardinals. Like other kinds of numbers, ordinals can be added, multiplied, and exponentiated.
Ordinals were introduced by [1] to accommodate infinite sequences and to classify derived sets, which he had previously introduced in 1872 while studying the uniqueness of trigonometric series.^{[2]}
Two sets S and S' have the same cardinality if there is a bijection between them (i.e. there exists a function f that is both injective and surjective, that is it maps each element x of S to a unique element y = f(x) of S' and each element y of S' comes from exactly one such element x of S).
If a partial order < is defined on set S, and a partial order <' is defined on set S' , then the posets (S,<) and (S' ,<') are order isomorphic if there is a bijection f that preserves the ordering. That is, f(a) <' f(b) if and only if a < b. Every well ordered set (S,<) is order isomorphic to the set of ordinals less than one specific ordinal number [the order type of (S,<)] under their natural ordering.
The finite ordinals (and the finite cardinals) are the natural numbers: 0, 1, 2, …, since any two total orderings of a finite set are order isomorphic. The least infinite ordinal is ω, which is identified with the cardinal number \aleph_0. However in the transfinite case, beyond ω, ordinals draw a finer distinction than cardinals on account of their order information. Whereas there is only one countably infinite cardinal, namely \aleph_0 itself, there are uncountably many countably infinite ordinals, namely

ω, ω + 1, ω + 2, …, ω·2, ω·2 + 1, …, ω^{2}, …, ω^{3}, …, ω^{ω}, …, ω^{ωω}, …, ε_{0}, ….
Here addition and multiplication are not commutative: in particular 1 + ω is ω rather than ω + 1 and likewise, 2·ω is ω rather than ω·2. The set of all countable ordinals constitutes the first uncountable ordinal ω_{1}, which is identified with the cardinal \aleph_1 (next cardinal after \aleph_0). Wellordered cardinals are identified with their initial ordinals, i.e. the smallest ordinal of that cardinality. The cardinality of an ordinal defines a many to one association from ordinals to cardinals.
In general, each ordinal α is the order type of the set of ordinals strictly less than the ordinal α itself. This property permits every ordinal to be represented as the set of all ordinals less than it. Ordinals may be categorized as: zero, successor ordinals, and limit ordinals (of various cofinalities). Given a class of ordinals, one can identify the αth member of that class, i.e. one can index (count) them. Such a class is closed and unbounded if its indexing function is continuous and never stops. The Cantor normal form uniquely represents each ordinal as a finite sum of ordinal powers of ω. However, this cannot form the basis of a universal ordinal notation due to such selfreferential representations as ε_{0} = ω^{ε0}. Larger and larger ordinals can be defined, but they become more and more difficult to describe. Any ordinal number can be made into a topological space by endowing it with the order topology; this topology is discrete if and only if the ordinal is a countable cardinal, i.e. at most ω. A subset of ω + 1 is open in the order topology if and only if either it is cofinite or it does not contain ω as an element.
Ordinals extend the natural numbers
A natural number (which, in this context, includes the number 0) can be used for two purposes: to describe the size of a set, or to describe the position of an element in a sequence. When restricted to finite sets these two concepts coincide; there is only one way to put a finite set into a linear sequence, up to isomorphism. When dealing with infinite sets one has to distinguish between the notion of size, which leads to cardinal numbers, and the notion of position, which is generalized by the ordinal numbers described here. This is because, while any set has only one size (its cardinality), there are many nonisomorphic wellorderings of any infinite set, as explained below.
Whereas the notion of cardinal number is associated with a set with no particular structure on it, the ordinals are intimately linked with the special kind of sets that are called wellordered (so intimately linked, in fact, that some mathematicians make no distinction between the two concepts). A wellordered set is a totally ordered set (given any two elements one defines a smaller and a larger one in a coherent way) in which there is no infinite decreasing sequence (however, there may be infinite increasing sequences); equivalently, every nonempty subset of the set has a least element. Ordinals may be used to label the elements of any given wellordered set (the smallest element being labelled 0, the one after that 1, the next one 2, "and so on") and to measure the "length" of the whole set by the least ordinal that is not a label for an element of the set. This "length" is called the order type of the set.
Any ordinal is defined by the set of ordinals that precede it: in fact, the most common definition of ordinals identifies each ordinal as the set of ordinals that precede it. For example, the ordinal 42 is the order type of the ordinals less than it, i.e., the ordinals from 0 (the smallest of all ordinals) to 41 (the immediate predecessor of 42), and it is generally identified as the set {0,1,2,…,41}. Conversely, any set (S) of ordinals that is downwardclosed—meaning that for any ordinal α in S and any ordinal β < α, β is also in the set—is (or can be identified with) an ordinal.
So far we have mentioned only finite ordinals, which are the natural numbers. But there are infinite ones as well: the smallest infinite ordinal is ω, which is the order type of the natural numbers (finite ordinals) and that can even be identified with the set of natural numbers (indeed, the set of natural numbers is wellordered—as is any set of ordinals—and since it is downward closed it can be identified with the ordinal associated with it, which is exactly how we define ω).
A graphical “matchstick” representation of the ordinal ω². Each stick corresponds to an ordinal of the form ω·m+n where m and n are natural numbers.
Perhaps a clearer intuition of ordinals can be formed by examining a first few of them: as mentioned above, they start with the natural numbers, 0, 1, 2, 3, 4, 5, … After all natural numbers comes the first infinite ordinal, ω, and after that come ω+1, ω+2, ω+3, and so on. (Exactly what addition means will be defined later on: just consider them as names.) After all of these come ω·2 (which is ω+ω), ω·2+1, ω·2+2, and so on, then ω·3, and then later on ω·4. Now the set of ordinals we form in this way (the ω·m+n, where m and n are natural numbers) must itself have an ordinal associated with it: and that is ω^{2}. Further on, there will be ω^{3}, then ω^{4}, and so on, and ω^{ω}, then ω^{ω²}, and much later on ε_{0} (epsilon nought) (to give a few examples of relatively small—countable—ordinals). We can go on in this way indefinitely far ("indefinitely far" is exactly what ordinals are good at: basically every time one says "and so on" when enumerating ordinals, it defines a larger ordinal). The smallest uncountable ordinal is the set of all countable ordinals, expressed as ω_{1}.
Definitions
Wellordered sets
In a wellordered set, every nonempty subset has a smallest element. Given the axiom of dependent choice, this is equivalent to just saying that the set is totally ordered and there is no infinite decreasing sequence, something perhaps easier to visualize. In practice, the importance of wellordering is justified by the possibility of applying transfinite induction, which says, essentially, that any property that passes on from the predecessors of an element to that element itself must be true of all elements (of the given wellordered set). If the states of a computation (computer program or game) can be wellordered in such a way that each step is followed by a "lower" step, then you can be sure that the computation will terminate.
Now we don't want to distinguish between two wellordered sets if they only differ in the "labeling of their elements", or more formally: if we can pair off the elements of the first set with the elements of the second set such that if one element is smaller than another in the first set, then the partner of the first element is smaller than the partner of the second element in the second set, and vice versa. Such a onetoone correspondence is called an order isomorphism and the two wellordered sets are said to be orderisomorphic, or similar (obviously this is an equivalence relation). Provided there exists an order isomorphism between two wellordered sets, the order isomorphism is unique: this makes it quite justifiable to consider the two sets as essentially identical, and to seek a "canonical" representative of the isomorphism type (class). This is exactly what the ordinals provide, and it also provides a canonical labeling of the elements of any wellordered set.
So we essentially wish to define an ordinal as an isomorphism class of wellordered sets: that is, as an equivalence class for the equivalence relation of "being orderisomorphic". There is a technical difficulty involved, however, in the fact that the equivalence class is too large to be a set in the usual Zermelo–Fraenkel (ZF) formalization of set theory. But this is not a serious difficulty. We will say that the ordinal is the order type of any set in the class.
Definition of an ordinal as an equivalence class
The original definition of ordinal number, found for example in Principia Mathematica, defines the order type of a wellordering as the set of all wellorderings similar (orderisomorphic) to that wellordering: in other words, an ordinal number is genuinely an equivalence class of wellordered sets. This definition must be abandoned in ZF and related systems of axiomatic set theory because these equivalence classes are too large to form a set. However, this definition still can be used in type theory and in Quine's axiomatic set theory New Foundations and related systems (where it affords a rather surprising alternative solution to the BuraliForti paradox of the largest ordinal).
Von Neumann definition of ordinals
First few Von Neumann ordinals

0


= {}

1

= { 0 }

= { {} }

2

= { 0, 1 }

= { {}, }

3

= { 0, 1, 2 }

= { {}, , } }

4

= { 0, 1, 2, 3 }

= { {}, , }, ,}} }

Rather than defining an ordinal as an equivalence class of wellordered sets, we will define it as a particular wellordered set that (canonically) represents the class. Thus, an ordinal number will be a wellordered set; and every wellordered set will be orderisomorphic to exactly one ordinal number.
The standard definition, suggested by John von Neumann, is: each ordinal is the wellordered set of all smaller ordinals. In symbols, λ = [0,λ).^{[3]}^{[4]} Formally:

A set S is an ordinal if and only if S is strictly wellordered with respect to set membership and every element of S is also a subset of S.
Note that the natural numbers are ordinals by this definition. For instance, 2 is an element of 4 = {0, 1, 2, 3}, and 2 is equal to {0, 1} and so it is a subset of {0, 1, 2, 3}.
It can be shown by transfinite induction that every wellordered set is orderisomorphic to exactly one of these ordinals, that is, there is an order preserving bijective function between them.
Furthermore, the elements of every ordinal are ordinals themselves. Whenever you have two ordinals S and T, S is an element of T if and only if S is a proper subset of T. Moreover, either S is an element of T, or T is an element of S, or they are equal. So every set of ordinals is totally ordered. Further, every set of ordinals is wellordered. This generalizes the fact that every set of natural numbers is wellordered.
Consequently, every ordinal S is a set having as elements precisely the ordinals smaller than S. For example, every set of ordinals has a supremum, the ordinal obtained by taking the union of all the ordinals in the set. This union exists regardless of the set's size, by the axiom of union.
The class of all ordinals is not a set. If it were a set, one could show that it was an ordinal and thus a member of itself, which would contradict its strict ordering by membership. This is the BuraliForti paradox. The class of all ordinals is variously called "Ord", "ON", or "∞".
An ordinal is finite if and only if the opposite order is also wellordered, which is the case if and only if each of its subsets has a maximum.
Other definitions
There are other modern formulations of the definition of ordinal. For example, assuming the axiom of regularity, the following are equivalent for a set x:
These definitions cannot be used in nonwellfounded set theories. In set theories with urelements, one has to further make sure that the definition excludes urelements from appearing in ordinals.
Transfinite sequence
If α is a limit ordinal and X is a set, an αindexed sequence of elements of X is a function from α to X. This concept, a transfinite sequence or ordinalindexed sequence, is a generalization of the concept of a sequence. An ordinary sequence corresponds to the case α = ω.
Transfinite induction
What is transfinite induction?
Transfinite induction holds in any wellordered set, but it is so important in relation to ordinals that it is worth restating here.

Any property that passes from the set of ordinals smaller than a given ordinal α to α itself, is true of all ordinals.
That is, if P(α) is true whenever P(β) is true for all β<α, then P(α) is true for all α. Or, more practically: in order to prove a property P for all ordinals α, one can assume that it is already known for all smaller β<α.
Transfinite recursion
Transfinite induction can be used not only to prove things, but also to define them. Such a definition is normally said to be by transfinite recursion – the proof that the result is welldefined uses transfinite induction. Let F denote a (class) function F to be defined on the ordinals. The idea now is that, in defining F(α) for an unspecified ordinal α, one may assume that F(β) is already defined for all β < α and thus give a formula for F(α) in terms of these F(β). It then follows by transfinite induction that there is one and only one function satisfying the recursion formula up to and including α.
Here is an example of definition by transfinite recursion on the ordinals (more will be given later): define function F by letting F(α) be the smallest ordinal not in the set {F(β)  β < α}, that is, the set consisting of all F(β) for β < α. This definition assumes the F(β) known in the very process of defining F; this apparent vicious circle is exactly what definition by transfinite recursion permits. In fact, F(0) makes sense since there is no ordinal β < 0, and the set {F(β)  β < 0} is empty. So F(0) is equal to 0 (the smallest ordinal of all). Now that F(0) is known, the definition applied to F(1) makes sense (it is the smallest ordinal not in the singleton set {F(0)} = {0}), and so on (the and so on is exactly transfinite induction). It turns out that this example is not very exciting, since provably F(α) = α for all ordinals α, which can be shown, precisely, by transfinite induction.
Successor and limit ordinals
Any nonzero ordinal has the minimum element, zero. It may or may not have a maximum element. For example, 42 has maximum 41 and ω+6 has maximum ω+5. On the other hand, ω does not have a maximum since there is no largest natural number. If an ordinal has a maximum α, then it is the next ordinal after α, and it is called a successor ordinal, namely the successor of α, written α+1. In the von Neumann definition of ordinals, the successor of α is \alpha\cup\{\alpha\} since its elements are those of α and α itself.^{[3]}
A nonzero ordinal that is not a successor is called a limit ordinal. One justification for this term is that a limit ordinal is indeed the limit in a topological sense of all smaller ordinals (under the order topology).
When \langle \alpha_{\iota}  \iota < \gamma \rangle is an ordinalindexed sequence, indexed by a limit γ and the sequence is increasing, i.e. \alpha_{\iota} < \alpha_{\rho}\! whenever \iota < \rho,\! we define its limit to be the least upper bound of the set \{ \alpha_{\iota}  \iota < \gamma \},\! that is, the smallest ordinal (it always exists) greater than any term of the sequence. In this sense, a limit ordinal is the limit of all smaller ordinals (indexed by itself). Put more directly, it is the supremum of the set of smaller ordinals.
Another way of defining a limit ordinal is to say that α is a limit ordinal if and only if:

There is an ordinal less than α and whenever ζ is an ordinal less than α, then there exists an ordinal ξ such that ζ < ξ < α.
So in the following sequence:

0, 1, 2, ... , ω, ω+1
ω is a limit ordinal because for any smaller ordinal (in this example, a natural number) we can find another ordinal (natural number) larger than it, but still less than ω.
Thus, every ordinal is either zero, or a successor (of a welldefined predecessor), or a limit. This distinction is important, because many definitions by transfinite induction rely upon it. Very often, when defining a function F by transfinite induction on all ordinals, one defines F(0), and F(α+1) assuming F(α) is defined, and then, for limit ordinals δ one defines F(δ) as the limit of the F(β) for all β<δ (either in the sense of ordinal limits, as we have just explained, or for some other notion of limit if F does not take ordinal values). Thus, the interesting step in the definition is the successor step, not the limit ordinals. Such functions (especially for F nondecreasing and taking ordinal values) are called continuous. We will see that ordinal addition, multiplication and exponentiation are continuous as functions of their second argument.
Indexing classes of ordinals
We have mentioned that any wellordered set is similar (orderisomorphic) to a unique ordinal number \alpha, or, in other words, that its elements can be indexed in increasing fashion by the ordinals less than \alpha. This applies, in particular, to any set of ordinals: any set of ordinals is naturally indexed by the ordinals less than some \alpha. The same holds, with a slight modification, for classes of ordinals (a collection of ordinals, possibly too large to form a set, defined by some property): any class of ordinals can be indexed by ordinals (and, when the class is unbounded in the class of all ordinals, this puts it in classbijection with the class of all ordinals). So we can freely speak of the \gammath element in the class (with the convention that the “0th” is the smallest, the “1th” is the next smallest, and so on). Formally, the definition is by transfinite induction: the \gammath element of the class is defined (provided it has already been defined for all \beta<\gamma), as the smallest element greater than the \betath element for all \beta<\gamma.
We can apply this, for example, to the class of limit ordinals: the \gammath ordinal, which is either a limit or zero is \omega\cdot\gamma (see ordinal arithmetic for the definition of multiplication of ordinals). Similarly, we can consider additively indecomposable ordinals (meaning a nonzero ordinal that is not the sum of two strictly smaller ordinals): the \gammath additively indecomposable ordinal is indexed as \omega^\gamma. The technique of indexing classes of ordinals is often useful in the context of fixed points: for example, the \gammath ordinal \alpha such that \omega^\alpha=\alpha is written \varepsilon_\gamma. These are called the "epsilon numbers".
Closed unbounded sets and classes
A class C of ordinals is said to be unbounded, or cofinal, when given any ordinal \alpha, there is a \beta in C such that \alpha < \beta (then the class must be a proper class, i.e., it cannot be a set). It is said to be closed when the limit of a sequence of ordinals in the class is again in the class: or, equivalently, when the indexing (class)function F is continuous in the sense that, for \delta a limit ordinal, F(\delta) (the \deltath ordinal in the class) is the limit of all F(\gamma) for \gamma<\delta; this is also the same as being closed, in the topological sense, for the order topology (to avoid talking of topology on proper classes, one can demand that the intersection of the class with any given ordinal is closed for the order topology on that ordinal, this is again equivalent).
Of particular importance are those classes of ordinals that are closed and unbounded, sometimes called clubs. For example, the class of all limit ordinals is closed and unbounded: this translates the fact that there is always a limit ordinal greater than a given ordinal, and that a limit of limit ordinals is a limit ordinal (a fortunate fact if the terminology is to make any sense at all!). The class of additively indecomposable ordinals, or the class of \varepsilon_\cdot ordinals, or the class of cardinals, are all closed unbounded; the set of regular cardinals, however, is unbounded but not closed, and any finite set of ordinals is closed but not unbounded.
A class is stationary if it has a nonempty intersection with every closed unbounded class. All superclasses of closed unbounded classes are stationary, and stationary classes are unbounded, but there are stationary classes that are not closed and stationary classes that have no closed unbounded subclass (such as the class of all limit ordinals with countable cofinality). Since the intersection of two closed unbounded classes is closed and unbounded, the intersection of a stationary class and a closed unbounded class is stationary. But the intersection of two stationary classes may be empty, e.g. the class of ordinals with cofinality ω with the class of ordinals with uncountable cofinality.
Rather than formulating these definitions for (proper) classes of ordinals, we can formulate them for sets of ordinals below a given ordinal \alpha: A subset of a limit ordinal \alpha is said to be unbounded (or cofinal) under \alpha provided any ordinal less than \alpha is less than some ordinal in the set. More generally, we can call a subset of any ordinal \alpha cofinal in \alpha provided every ordinal less than \alpha is less than or equal to some ordinal in the set. The subset is said to be closed under \alpha provided it is closed for the order topology in \alpha, i.e. a limit of ordinals in the set is either in the set or equal to \alpha itself.
Arithmetic of ordinals
There are three usual operations on ordinals: addition, multiplication, and (ordinal) exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit wellordered set that represents the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. The socalled "natural" arithmetical operations retain commutativity at the expense of continuity.
Ordinals and cardinals
Initial ordinal of a cardinal
Each ordinal has an associated axiom of choice is equivalent to the statement that every set can be wellordered, i.e. that every cardinal has an initial ordinal. In this case, it is traditional to identify the cardinal number with its initial ordinal, and we say that the initial ordinal is a cardinal.
Cantor used the cardinality to partition ordinals into classes. He referred to the natural numbers as the first number class, the ordinals with cardinality \aleph_0 (the countably infinite ordinals) as the second number class and generally, the ordinals with cardinality \aleph_{n2} as the nth number class.^{[5]}
The αth infinite initial ordinal is written \omega_\alpha. Its cardinality is written \aleph_\alpha. For example, the cardinality of ω_{0} = ω is \aleph_0, which is also the cardinality of ω^{2} or ε_{0} (all are countable ordinals). So (assuming the axiom of choice) we identify ω with \aleph_0, except that the notation \aleph_0 is used when writing cardinals, and ω when writing ordinals (this is important since, for example, \aleph_0^2 = \aleph_0 whereas \omega^2>\omega). Also, \omega_1 is the smallest uncountable ordinal (to see that it exists, consider the set of equivalence classes of wellorderings of the natural numbers: each such wellordering defines a countable ordinal, and \omega_1 is the order type of that set), \omega_2 is the smallest ordinal whose cardinality is greater than \aleph_1, and so on, and \omega_\omega is the limit of the \omega_n for natural numbers n (any limit of cardinals is a cardinal, so this limit is indeed the first cardinal after all the \omega_n).
See also Von Neumann cardinal assignment.
Cofinality
The cofinality of an ordinal \alpha is the smallest ordinal \delta that is the order type of a cofinal subset of \alpha. Notice that a number of authors define cofinality or use it only for limit ordinals. The cofinality of a set of ordinals or any other well ordered set is the cofinality of the order type of that set.
Thus for a limit ordinal, there exists a \deltaindexed strictly increasing sequence with limit \alpha. For example, the cofinality of ω² is ω, because the sequence ω·m (where m ranges over the natural numbers) tends to ω²; but, more generally, any countable limit ordinal has cofinality ω. An uncountable limit ordinal may have either cofinality ω as does \omega_\omega or an uncountable cofinality.
The cofinality of 0 is 0. And the cofinality of any successor ordinal is 1. The cofinality of any limit ordinal is at least \omega.
An ordinal that is equal to its cofinality is called regular and it is always an initial ordinal. Any limit of regular ordinals is a limit of initial ordinals and thus is also initial even if it is not regular, which it usually is not. If the Axiom of Choice, then \omega_{\alpha+1} is regular for each α. In this case, the ordinals 0, 1, \omega, \omega_1, and \omega_2 are regular, whereas 2, 3, \omega_\omega, and ω_{ω·2} are initial ordinals that are not regular.
The cofinality of any ordinal α is a regular ordinal, i.e. the cofinality of the cofinality of α is the same as the cofinality of α. So the cofinality operation is idempotent.
Some “large” countable ordinals
We have already mentioned (see Cantor normal form) the ordinal ε_{0}, which is the smallest satisfying the equation \omega^\alpha = \alpha, so it is the limit of the sequence 0, 1, \omega, \omega^\omega, \omega^{\omega^\omega}, etc. Many ordinals can be defined in such a manner as fixed points of certain ordinal functions (the \iotath ordinal such that \omega^\alpha = \alpha is called \varepsilon_\iota, then we could go on trying to find the \iotath ordinal such that \varepsilon_\alpha = \alpha, “and so on”, but all the subtlety lies in the “and so on”). We can try to do this systematically, but no matter what system is used to define and construct ordinals, there is always an ordinal that lies just above all the ordinals constructed by the system. Perhaps the most important ordinal that limits a system of construction in this manner is the Church–Kleene ordinal, \omega_1^{\mathrm{CK}} (despite the \omega_1 in the name, this ordinal is countable), which is the smallest ordinal that cannot in any way be represented by a computable function (this can be made rigorous, of course). Considerably large ordinals can be defined below \omega_1^{\mathrm{CK}}, however, which measure the “prooftheoretic strength” of certain formal systems (for example, \varepsilon_0 measures the strength of Peano arithmetic). Large ordinals can also be defined above the ChurchKleene ordinal, which are of interest in various parts of logic.
Topology and ordinals
Any ordinal can be made into a topological space in a natural way by endowing it with the order topology. See the Topology and ordinals section of the "Order topology" article.
Downward closed sets of ordinals
A set is downward closed if anything less than an element of the set is also in the set. If a set of ordinals is downward closed, then that set is an ordinal—the least ordinal not in the set.
Examples:

The set of ordinals less than 3 is 3 = { 0, 1, 2 }, the smallest ordinal not less than 3.

The set of finite ordinals is infinite, the smallest infinite ordinal: ω.

The set of countable ordinals is uncountable, the smallest uncountable ordinal: ω_{1}.
See also
Notes

^ Thorough introductions are given by Levy (1979) and Jech (2003).

^ Hallett, Michael (1979), "Towards a theory of mathematical research programmes. I", The British Journal for the Philosophy of Science 30 (1): 1–25, . See the footnote on p. 12.

^ ^{}a ^{b} von Neumann 1923

^ Levy (1979, p. 52) attributes the idea to unpublished work of Zermelo in 1916 and several papers by von Neumann the 1920s.

^ Dauben (1990:97)
References

Cantor, G., (1897), Beitrage zur Begrundung der transfiniten Mengenlehre. II (tr.: Contributions to the Founding of the Theory of Transfinite Numbers II), Mathematische Annalen 49, 207246 English translation.

Conway, J. H. and Guy, R. K. "Cantor's Ordinal Numbers." In The Book of Numbers. New York: SpringerVerlag, pp. 266–267 and 274, 1996.

Dauben, Joseph Warren, (1990), Georg Cantor: his mathematics and philosophy of the infinite. Chapter 5: The Mathematics of Cantor's Grundlagen. ISBN 0691024472

Hamilton, A. G. (1982), Numbers, Sets, and Axioms : the Apparatus of Mathematics, New York: Cambridge University Press, See Ch. 6, "Ordinal and cardinal numbers"

Kanamori, A., Set Theory from Cantor to Cohen, to appear in: Andrew Irvine and John H. Woods (editors), The Handbook of the Philosophy of Science, volume 4, Mathematics, Cambridge University Press.

Levy, A. (1979), Basic Set Theory, Berlin, New York: Reprinted 2002, Dover. ISBN 0486420795

Jech, Thomas (2003),

Sierpiński, W. (1965). Cardinal and Ordinal Numbers (2nd ed.). Warszawa: Państwowe Wydawnictwo Naukowe. Also defines ordinal operations in terms of the Cantor Normal Form.

Suppes, P. (1960), Axiomatic Set Theory, D.Van Nostrand Company Inc., ISBN 0486616304


 English translation of von Neumann 1923.
External links

Hazewinkel, Michiel, ed. (2001), "Ordinal number",

Weisstein, Eric W., "Ordinal Number", MathWorld.

Ordinals at ProvenMath

Beitraege zur Begruendung der transfiniten Mengenlehre Cantor's original paper published in Mathematische Annalen 49(2), 1897

Ordinal calculator GPL'd free software for computing with ordinals and ordinal notations
This article was sourced from Creative Commons AttributionShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, EGovernment Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a nonprofit organization.