Challenges to predicative foundations of arithmetic

This is a sequel to our article “Predicative foundations of arithmetic” (1995), referred to in the following as [PFA]; here we review and clarify what was accomplished in [PFA], present some improvements and extensions, and respond to several challenges. The classic challenge to a program of the sort exemplified by [PFA] was issued by Charles Parsons in a 1983 paper, subsequently revised and expanded as Parsons (1992). Another critique is due to Daniel Isaacson (1987). Most recently, Alexander George and Daniel Velleman (1996) have examined [PFA] closely in the context of a general discussion of different philosophical approaches to the foundations of arithmetic.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,707
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

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

31 ( #138,895 of 1,939,061 )

Recent downloads (6 months)

4 ( #161,507 of 1,939,061 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.