Takeuti’s Well-Ordering Proof: Finitistically Fine?

In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics the Cshpm 2017 Annual Meeting in Toronto, Ontario. Birkhäuser. pp. 167-180 (2018)
  Copy   BIBTEX

Abstract

If one of Gentzen’s consistency proofs for pure number theory could be shown to be finitistically acceptable, an important part of Hilbert’s program would be vindicated. This paper focuses on whether the transfinite induction on ordinal notations needed for Gentzen’s second proof can be finitistically justified. In particular, the focus is on Takeuti’s purportedly finitistically acceptable proof of the well ordering of ordinal notations in Cantor normal form.The paper begins with a historically informed discussion of finitism and its limits, before introducing Gentzen and Takeuti’s respective proofs. The rest of the paper is dedicated to investigating the finitistic acceptability of Takeuti’s proof, including a small but important fix to that proof. That discussion strongly suggests that there is a philosophically interesting finitist standpoint that Takeuti’s proof, and therefore Gentzen’s proof, conforms to.

Links

PhilArchive



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

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

Takeuti’s Well-Ordering Proof: Finitistically Fine?Eamon Darnell & Aaron Thomas-Bolduc - 2018 - In Amy Ackerberg-Hastings, Marion W. Alexander, Zoe Ashton, Christopher Baltus, Phil Bériault, Daniel J. Curtin, Eamon Darnell, Craig Fraser, Roger Godard, William W. Hackborn, Duncan J. Melville, Valérie Lynn Therrien, Aaron Thomas-Bolduc & R. S. D. Thomas (eds.), Research in History and Philosophy of Mathematics: The Cshpm 2017 Annual Meeting in Toronto, Ontario. Springer Verlag. pp. 167-180.
Takeuti's proof theory in the context of the Kyoto School.Andrew Arana - 2019 - Jahrbuch Für Philosophie Das Tetsugaku-Ronso 46:1-17.
Consistency proof via pointwise induction.Toshiyasu Arai - 1998 - Archive for Mathematical Logic 37 (3):149-165.
Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Proof theory and set theory.Gaisi Takeuti - 1985 - Synthese 62 (2):255 - 263.
Decoding Gentzen's Notation.Luca Bellotti - 2018 - History and Philosophy of Logic 39 (3):270-288.
Determinate logic and the Axiom of Choice.J. P. Aguilera - 2020 - Annals of Pure and Applied Logic 171 (2):102745.
[Omnibus Review].Dag Prawitz - 1991 - Journal of Symbolic Logic 56 (3):1094-1096.
omnibus Review. [REVIEW]Dag Prawitz - 1991 - Journal of Symbolic Logic 56 (3):1094-1096.
Sur la théorie des démonstrations.Y. Gauthier - 1981 - Philosophiques 8 (2):273-285.

Analytics

Added to PP
2020-06-17

Downloads
12 (#1,080,675)

6 months
6 (#509,130)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Eamon Darnell
University of Toronto, St. George Campus
Aaron Thomas-Bolduc
University of Calgary

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references