Ackermann ordinal

In mathematics, the Ackermann ordinal is a certain large countable ordinal, named after Wilhelm Ackermann. The term "Ackermann ordinal" is also occasionally used for the small Veblen ordinal, a somewhat larger ordinal.

Unfortunately there is no standard notation for ordinals beyond the Feferman–Schütte ordinal Γ₀. Most systems of notation use symbols such as ψ(α), θ(α), ψ_α(β), some of which are modifications of the Veblen functions to produce countable ordinals even for uncountable arguments, and some of which are "collapsing functions".

The smaller Ackermann ordinal is the limit of a system of ordinal notations invented by harvtxt|Ackermann|1951, and is sometimes denoted by $phi_$ Omega^2(0) or $heta(Omega^2)$ or $psi(Omega^2)$ . Ackermann's system of notation is weaker than the system introduced much earlier by harvtxt|Veblen|1908, which he seems to have been unaware of.

References

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

Ordinal notation — In mathematical logic and set theory, an ordinal notation is a finite sequence of symbols from a finite alphabet which names an ordinal number according to some scheme which gives meaning to the language. There are many such schemes of ordinal… … Wikipedia
Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger … Wikipedia
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
Small Veblen ordinal — In mathematics, the small Veblen ordinal is a certain large countable ordinal, named after Oswald Veblen. It is occasionally called the Ackermann ordinal, though the Ackermann ordinal described by harvtxt|Ackermann|1951 is somewhat smaller than… … Wikipedia
Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… … Wikipedia
Church–Kleene ordinal — In mathematics, the Church–Kleene ordinal, , is a large countable ordinal. It is the smallest non recursive ordinal. It is named after Alonzo Church and S. C. Kleene. References Church, Alonzo; Kleene, S. C. (1937), Formal definitions in the… … Wikipedia
List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A … Wikipedia
Kruskal's tree theorem — In mathematics, Kruskal s tree theorem states that the set of finite trees over a well quasi ordered set of labels is itself well quasi ordered (under homeomorphic embedding). The theorem was proved byharvs|txt=yes|year= 1960 |authorlink=Joseph… … Wikipedia
Hiérarchie de croissance rapide — En théorie de la calculabilité et en théorie de la démonstration, une hiérarchie de croissance rapide (parfois appelée une hiérarchie de Grzegorczyk (en) étendue) est une famille, indexée par les ordinaux, de fonctions rapidement croissantes … Wikipédia en Français
Théorème de Kruskal — En mathématiques, le théorème des arbres de Kruskal est un résultat de théorie des graphes conjecturé en 1937 par Andrew Vázsonyi et démontré indépendamment en 1960 par Joseph Kruskal et S. Tarkowski[1], affirmant que l ensemble des arbres… … Wikipédia en Français

Academic Dictionaries and Encyclopedias

Ackermann ordinal

Look at other dictionaries:

Share the article and excerpts

Academic Dictionaries and Encyclopedias

Wikipedia

Ackermann ordinal

Look at other dictionaries:

Share the article and excerpts

Direct link