# Feferman–Schütte ordinal

998 VIEWS

Everipedia is now IQ.wiki - Join the IQ Brainlist and our Discord for early access to editing on the new platform and to participate in the beta testing.

# Feferman–Schütte ordinal

Feferman–Schütte ordinal

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,^{[1]}^{[2]} 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.

`There is no standard notation for ordinals at and beyond the Feferman–Schütte ordinal, so there are several ways of representing it, some of which useordinal collapsing functions:,or`

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

[1]

Citation Linkopenlibrary.orgKurt Schütte,

*Proof theory*, Grundlehren der Mathematischen Wissenschaften, Band 225, Springer-Verlag, Berlin, Heidelberg, New York, 1977, xii + 302 pp.Sep 20, 2019, 4:45 PM

[12]

Citation Linken.wikipedia.orgThe original version of this page is from Wikipedia, you can edit the page right here on Everipedia.Text is available under the Creative Commons Attribution-ShareAlike License.Additional terms may apply.See everipedia.org/everipedia-termsfor further details.Images/media credited individually (click the icon for details).

Sep 20, 2019, 4:45 PM