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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Hájek, P. and P. Pudlák: 1993, Metamathematics of First-Order Arithmetic, Springer, Berlin.
Kalsbeek, M.: 1989, ‘An Orey Sentence for Predicative Arithmetic', Technical Report X-89–01, ITLI, University of Amsterdam, Holland.
Nelson, E.: 1986, Predicative Arithmetic, Princeton University Press, Princeton.
Parikh, R.: 1971, ‘Existence and Feasibility in Arithmetic', The Journal of Symbolic Logic 36, 494–508.
Paris, J. and C. Dimitracopoulos: 1983, ‘A Note on the Undefinability of Cuts', The Journal of Symbolic Logic 48, 564–9.
Paris, J. and A. Wilkie: 1987, ‘On the Scheme of Induction for Bounded Arithmetic Formulas', Annals of Pure and Applied Logic 35, 261–302.
Pudlák, P.: 1985, ‘Cuts, Consistency Statements and Interpretations', The Journal of Symbolic Logic 50, 423–41.
Visser, A.: 1990, ‘Interpretability Logic', in P. Petkov (ed.), Mathematical Logic, Proceedings of the Heyting 1998 Summer School in Varna, Bulgaria, pp. 175–209.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iwan, S. On The Untenability Of Nelson's Predicativism. Erkenntnis 53, 147–154 (2000). https://doi.org/10.1023/A:1005651027553
Issue Date:
DOI: https://doi.org/10.1023/A:1005651027553