Unfolding finitist arithmetic

Review of Symbolic Logic 3 (4):665-689 (2010)
  Copy   BIBTEX


The concept of the (full) unfolding of a schematic system is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted ? The program to determine for various systems of foundational significance was previously carried out for a system of nonfinitist arithmetic, ; it was shown that is proof-theoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system of finitist arithmetic, , and for an extension of that by a form of the so-called Bar Rule. It is shown that and are proof-theoretically equivalent, respectively, to Primitive Recursive Arithmetic, , and to Peano Arithmetic,



    Upload a copy of this work     Papers currently archived: 92,873

External links

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

Through your library


Added to PP

85 (#202,560)

6 months
17 (#161,415)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Predicativity and Feferman.Laura Crosilla - 2017 - In Gerhard Jäger & Wilfried Sieg (eds.), Feferman on Foundations: Logic, Mathematics, Philosophy. Cham: Springer. pp. 423-447.
Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.
A feasible theory of truth over combinatory algebra.Sebastian Eberhard - 2014 - Annals of Pure and Applied Logic 165 (5):1009-1033.

Add more citations

References found in this work

Constructivism in mathematics: an introduction.A. S. Troelstra - 1988 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.. Edited by D. van Dalen.
Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
Grundlagen der Mathematik.S. C. Kleene - 1940 - Journal of Symbolic Logic 5 (1):16-20.
Hilbert’s Program.Richard Zach - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.

View all 16 references / Add more references