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

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,
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1755020310000183
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,241
Through your library

References found in this work BETA

Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
Fragments of Arithmetic.Wilfried Sieg - 1983 - Annals of Pure and Applied Logic 28 (1):33-71.

View all 14 references / Add more references

Citations of this work BETA

A Feasible Theory of Truth Over Combinatory Algebra.Sebastian Eberhard - 2014 - Annals of Pure and Applied Logic 165 (5):1009-1033.

Add more citations

Similar books and articles


Added to PP index

Total views
61 ( #150,559 of 2,325,132 )

Recent downloads (6 months)
2 ( #455,085 of 2,325,132 )

How can I increase my downloads?


My notes