Feferman–Schütte ordinal

From Wikipedia, the free encyclopedia

In mathematics, the Feferman–Schütte ordinal Γ0 is a large countable ordinal. It is the proof-theoretic ordinal of several mathematical theories, such as arithmetical transfinite recursion. It is named after Solomon Feferman and Kurt Schütte, the former of whom suggested the name Γ0.[1]

There is no standard notation for ordinals beyond the Feferman–Schütte ordinal. There are several ways of representing the Feferman–Schütte ordinal, some of which use ordinal collapsing functions: , , , or .

Definition[edit]

The Feferman–Schütte ordinal can be defined as the smallest ordinal that cannot be obtained by starting with 0 and using the operations of ordinal addition and the Veblen functions φα(β). That is, it is the smallest α such that φα(0) = α.

Properties[edit]

This ordinal is sometimes said to be the first impredicative ordinal,[2][3] though this is controversial, partly because there is no generally accepted precise definition of "predicative". Sometimes an ordinal is said to be predicative if it is less than Γ0.

Any recursive path ordering whose function symbols are well-founded with order type less than that of itself has order type .[4]

References[edit]

  1. ^ G. Takeuti, Proof Theory (1975, p.413)
  2. ^ Kurt Schütte, Proof theory, Grundlehren der Mathematischen Wissenschaften, Band 225, Springer-Verlag, Berlin, Heidelberg, New York, 1977, xii + 302 pp.
  3. ^ Solomon Feferman, "Predicativity" (2002)
  4. ^ N. Dershowitz, Termination of Rewriting (pp.98--99), Journal of Symbolic Computation (1987). Accessed 3 October 2022.
  • Pohlers, Wolfram (1989), Proof theory, Lecture Notes in Mathematics, vol. 1407, Berlin: Springer-Verlag, doi:10.1007/978-3-540-46825-7, ISBN 3-540-51842-8, MR 1026933
  • Weaver, Nik (2005), Predicativity beyond Gamma_0, arXiv:math/0509244, Bibcode:2005math......9244W