Jump to content

Feferman–Schütte ordinal

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by MystBot (talk | contribs) at 10:27, 7 November 2011 (r2.7.1) (Robot: Adding fr:Ordinal de Feferman-Schütte). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

It is sometimes said to be the first impredicative ordinal, 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.

Definition

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) = α.

References

  • Pohlers, Wolfram (1989), Proof theory, Lecture Notes in Mathematics, vol. 1407, Berlin: Springer-Verlag, ISBN 3-540-51842-8, MR 1026933
  • Weaver, Nik (2005), Predicativity beyond Gamma_0, arXiv:math/0509244