In mathematical logic and set theory, an ordinal notation is a partial function mapping the set of all finite sequences of symbols, themselves members of a finite alphabet, to a countable set of ordinals. A Gödel numbering is a function mapping the set of well-formed formulae (a finite sequence of symbols on which the ordinal notation function is defined) of some formal language to the natural numbers. This associates each well-formed formula with a unique natural number, called its Gödel number. If a Gödel numbering is fixed, then the subset relation on the ordinals induces an ordering on well-formed formulae which in turn induces a well-ordering on the subset of natural numbers. A recursive ordinal notation must satisfy the following two additional properties:
the subset of natural numbers is a recursive set
the induced well-ordering on the subset of natural numbers is a recursive relation
There are many such schemes of ordinal notations, including schemes by Wilhelm Ackermann, Heinz Bachmann, Wilfried Buchholz, Georg Cantor, Solomon Feferman, Gerhard Jäger, Isles, Pfeiffer, Wolfram Pohlers, Kurt Schütte, Gaisi Takeuti (called ordinal diagrams), Oswald Veblen. Stephen Cole Kleene has a system of notations, called Kleene's O, which includes ordinal notations but it is not as well behaved as the other systems described here.
Usually one proceeds by defining several functions from ordinals to ordinals and representing each such function by a symbol. In many systems, such as Veblen's well known system, the functions are normal functions, that is, they are strictly increasing and continuous in at least one of their arguments, and increasing in other arguments. Another desirable property for such functions is that the value of the function is greater than each of its arguments, so that an ordinal is always being described in terms of smaller ordinals. There are several such desirable properties. Unfortunately, no one system can have all of them since they contradict each other.
In mathematical logic and set theory, an ordinalnotation is a partial function mapping the set of all finite sequences of symbols, themselves members...
ordinalnotations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinalnotation is a notation or...
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite...
In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation...
ordinal notations. The proof-theoretic ordinal of such a theory T {\displaystyle T} is the supremum of the order types of all ordinalnotations (necessarily...
neglected Z notation, a formal notation for specifying objects using Zermelo–Fraenkel set theory and first-order predicate logic Ordinalnotation Set-builder...
Ordinal data is a categorical, statistical data type where the variables have natural, ordered categories and the distances between the categories are...
an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose...
an ordinalnotation in Kleene's O {\displaystyle {\mathcal {O}}} . Arithmetical hierarchy Large countable ordinalOrdinal analysis Ordinalnotation Hartley...
ordinalnotation, which is a concrete, effective description of the ordinal. An ordinalnotation is an effective description of a countable ordinal by...
Date and time notation in the United Kingdom records the date using the day–month–year format (31 December 1999, 31/12/99 or 31/12/1999). The time can...
Veblen ordinal, a somewhat larger ordinal. There is no standard notation for ordinals beyond the Feferman–Schütte ordinal Γ0. Most systems of notation use...
is the third largest city in the country"), in which case they serve as ordinal numbers. Natural numbers are sometimes used as labels—also known as nominal...
limit of this notation is the Takeuti–Feferman–Buchholz ordinal. Let P {\displaystyle P} be the class of additively principal ordinals. Buchholz showed...
functions from ordinals to ordinals), introduced by Oswald Veblen in Veblen (1908). If φ0 is any normal function, then for any non-zero ordinal α, φα is the...
the large Veblen ordinal is a certain large countable ordinal, named after Oswald Veblen. There is no standard notation for ordinals beyond the Feferman–Schütte...
the convention of pronouncing the day and the month as an ordinal number, because ordinal numbers are written in German followed by a dot. German grammar...
are written as: I, II, III, IV, V, VI, VII, VIII, IX, X, XI, XII The notations IV and IX can be read as "one less than five" (4) and "one less than ten"...
possible to define a cardinal number ℵα for every ordinal number α, as described below. The concept and notation are due to Georg Cantor, who defined the notion...
mathematics Japanese punctuation Korean punctuation Ordinal indicator – Character(s) following an ordinal number (used of the style 1st, 2nd, 3rd, 4th or...
Ackermann ordinal described by Ackermann (1951) is somewhat smaller than the small Veblen ordinal. There is no standard notation for ordinals beyond the...