Internal and external consistency of arithmetic

Logica Trianguli 5:19-41 (2001)
  Copy   BIBTEX

Abstract

What Gödel referred to as “outer” consistency is contrasted with the “inner” consistency of arithmetic from a constructivist point of view. In the settheoretic setting of Peano arithmetic, the diagonal procedure leads out of the realm of natural numbers. It is shown that Hilbert’s programme of arithmetization points rather to an “internalisation” of consistency. The programme was continued by Herbrand, Gödel and Tarski. Tarski’s method of quantifier elimination and Gödel’s Dialectica interpretation are part and parcel of Hilbert’s finitist ideal which is achieved by going back to Kronecker’s programme of a general arithmetic of forms or homogeneous polynomials. The paper can be seen as a historical complement to our result on “The Internal Consistency of Arithmetic with Infinite Descent” . An internal consistency proof for arithmetic means that transfinite induction is not needed and that arithmetic can be shown to be consistent within the bounds of arithmetic, that is with the help of Fermat’s infinite descent and Kronecker’s general or polynomial arithmetic, thus returning into arithmetic without the detour of Cantor’s transfinite arithmetic of ideal elements

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-20

Downloads
24 (#642,030)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yvon Gauthier
Université de Montréal

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references