On the restricted ordinal theorem

Journal of Symbolic Logic 9 (2):33-41 (1944)
  Copy   BIBTEX

Abstract

The proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could be found only by transcending the axioms and proof processes of that formal system. Gentzen's proof succeeds by utilisingtransfinite inductionto prove that certain sequences of reduction processes, enumerated by ordinals less than ε (the first ordinal to satisfy ε = ὡ) are finite. Were it possible to provethe restricted ordinal theorem, that a descending sequence of ordinals, less thanε, is finite, in Gentzen's “reine Zahlentheorie,” then it would be possible to determine a contradiction in that number system. In his paper, Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument. There is also a method of reducing transfinite induction, for ordinals less than ε, to a number-theoretic principle given by Hilbert and Bernays, and a similar method by Ackermann. None of these proofs of transfinite induction isfinitist.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
Table of Contents.Uwe Meixner - 1992 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 7 (2):1-2.
A constructive formulation of Gleason's theorem.Helen Billinge - 1997 - Journal of Philosophical Logic 26 (6):661-670.
Patterns of projecta.Adam Krawczyk - 1981 - Journal of Symbolic Logic 46 (2):287-295.
Ordinal numbers and the Hilbert basis theorem.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (3):961-974.

Analytics

Added to PP
2009-01-28

Downloads
32 (#431,738)

6 months
5 (#246,492)

Historical graph of downloads
How can I increase my downloads?