On the untenability of Nelson's predicativism

Erkenntnis 53 (1-2):147-154 (2000)
By combining some technical results from metamathematicalinvestigations of systems of Bounded Arithmetic, I will givean argument for the untenability of Nelson's finitistic program,encapsulated in his book Predicative Arithmetic.
Keywords Philosophy   Philosophy   Epistemology   Ethics   Logic   Ontology
Categories (categorize this paper)
DOI 10.1023/A:1005651027553
 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: 16,667
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
Albert Visser (2009). The Predicative Frege Hierarchy. Annals of Pure and Applied Logic 160 (2):129-153.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

50 ( #68,426 of 1,726,249 )

Recent downloads (6 months)

13 ( #53,688 of 1,726,249 )

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.