On the untenability of Nelson's predicativism

Erkenntnis 53 (1-2):147-154 (2000)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1005651027553

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Preaching on the Environment.Holmes Rolston - unknown
Nelson algebras through Heyting ones: I.Andrzej Sendlewski - 1990 - Studia Logica 49 (1):105-126.
Re-radicalizing Nelson's feminist empiricism.Edrie Sobstyl - 2004 - Hypatia 19 (1):119-141.
Leonard Nelson.Kelley Ross - manuscript
Induction and predicativity.Peter Smith - unknown
The Hiddenness Argument Revisited.J. L. Schellenberg - 2005 - Religious Studies 41 (3):287-303.
Preventive War 'the Supreme Crime'.Noam Chomsky - unknown
How Bad Is Rape?H. E. Baber - 1987 - Hypatia 2 (2):125-138.

Analytics

Added to PP
2009-01-28

Downloads
101 (#168,750)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.
The predicative Frege hierarchy.Albert Visser - 2009 - Annals of Pure and Applied Logic 160 (2):129-153.
Empiricism, Probability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Journal of Applied Logic 12 (3):319–348.
Finitistic Arithmetic and Classical Logic.Mihai Ganea - 2014 - Philosophia Mathematica 22 (2):167-197.

Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
Predicative arithmetic.Edward Nelson - 1986 - Princeton, N.J.: Princeton University Press.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
Metamathematics of First-Order Arithmetic.P. Hájek & P. Pudlák - 2000 - Studia Logica 64 (3):429-430.
A note on the undefinability of cuts.J. B. Paris & C. Dimitracopoulos - 1983 - Journal of Symbolic Logic 48 (3):564-569.

View all 6 references / Add more references