Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T03:53:42.360Z Has data issue: false hasContentIssue false

UNFOLDING FINITIST ARITHMETIC

Published online by Cambridge University Press:  11 August 2010

SOLOMON FEFERMAN*
Affiliation:
Stanford University
THOMAS STRAHM*
Affiliation:
University of Bern
*
*DEPARTMENT OF MATHEMATICS, STANFORD UNIVERSITY, STANFORD, CA 94305. E-mail: feferman@stanford.edu
†INSTITUT FÜR INFORMATIK UND ANGEWANDTE MATHEMATIK, UNIVERSITÄT BERN, NEUBRÜCKSTRASSE 10, CH-3012 BERN, SWIZTERLAND. E-mail: strahm@iam.unibe.ch
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The concept of the (full) unfolding $\user1{{\cal U}}(S)$ of a schematic system $S$ is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted $S$? The program to determine $\user1{{\cal U}}(S)$ for various systems $S$ of foundational significance was previously carried out for a system of nonfinitist arithmetic, $NFA$; it was shown that $\user1{{\cal U}}(NFA)$ 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, $FA$, and for an extension of that by a form $BR$ of the so-called Bar Rule. It is shown that $\user1{{\cal U}}(FA)$ and $\user1{{\cal U}}(FA + BR)$ are proof-theoretically equivalent, respectively, to Primitive Recursive Arithmetic, $PRA$, and to Peano Arithmetic, $PA$.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010