Nominalistic ordinals, recursion on higher types, and finitism

Bulletin of Symbolic Logic 25 (1):101-124 (2019)
  Copy   BIBTEX

Abstract

In 1936, Gerhard Gentzen published a proof of consistency for Peano Arithmetic using transfinite induction up to ε0, which was considered a finitistically acceptable procedure by both Gentzen and Paul Bernays. Gentzen’s method of arithmetising ordinals and thus avoiding the Platonistic metaphysics of set theory traces back to the 1920s, when Bernays and David Hilbert used the method for an attempted proof of the Continuum Hypothesis. The idea that recursion on higher types could be used to simulate the limit-building in transfinite recursion seems to originate from Bernays. The main difficulty, which was already discovered in Gabriel Sudan’s nearly forgotten paper of 1927, was that measuring transfinite ordinals requires stronger methods than representing them. This paper presents a historical account of the idea of nominalistic ordinals in the context of the Hilbert Programme as well as Gentzen and Bernays’ finitary interpretation of transfinite induction.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
Why Should We Care About Nietzsche's ‘Higher Men’?Omri Ben‐Zvi - 2016 - European Journal of Philosophy 24 (4):638-656.
Why Should We Care About Nietzsche's ‘Higher Men’?Omri Ben-Zvi - 2017 - European Journal of Philosophy 25 (3):638-656.
On the Coherence of Strict Finitism.Auke Alesander Montesano Montessori - 2019 - Kriterion - Journal of Philosophy 33 (2):1-14.
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.

Analytics

Added to PP
2019-02-08

Downloads
27 (#572,408)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Maria Hämeen-Anttila
University of Helsinki

Citations of this work

No citations found.

Add more citations