Dialectica 43 (4):329-337 (1989)

Authors
Yvon Gauthier
Université de Montréal
Abstract
SummaryFinite, or Fermat arithmetic, as we call it, differs from Peano arithmetic in that it does not involve the existence of an infinite set or Peano's induction postulate. Fermat's method of infinite descent takes the place of bound induction, and we show that a con‐structivist interpretation of logical connectives and quantifiers can account for the predicative finitary nature of Fermat's arithmetic. A non‐set‐theoretic arithemetical logic thus seems best suited to a constructivist‐inspired number theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1111/j.1746-8361.1989.tb00949.x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,827
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Mathematical Logic.Joseph R. Shoenfield - 1967 - Reading, Mass., Addison-Wesley Pub. Co..
Predicative Arithmetic.Edward Nelson - 1986 - Princeton University Press.
Selected Works in Logic.Th Skolem & Jens Erik Fenstad - 1970 - Universitetsforlaget.
Proof Theory.Gaisi Takeuti - 1975 - Elsevier.
Predicative Arithmetic.Edward Nelson - 1989 - Studia Logica 48 (1):129-130.

View all 6 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-21

Total views
17 ( #600,733 of 2,432,741 )

Recent downloads (6 months)
2 ( #294,235 of 2,432,741 )

How can I increase my downloads?

Downloads

My notes