Predicative foundations of arithmetic
type: Item
instance of: scholarly article
title: Predicative foundations of arithmetic
zbMATH Open document ID: 0816.03030
DOI: 10.1007/BF01052728
author: Solomon Feferman
author: Geoffrey Hellman
published in: Journal of Philosophical Logic
publication date: 1995-02-22T00:00:00Z
review text: The aim of the paper is to show that a predicatively acceptable axiomatization of the natural number system can be formulated and that the existence of the appropriate structures as well as the categoricity of the axioms can be proved in a predicatively acceptable way. A three- sorted system EFSC (elementary theory of finite sets and classes) and an extension of EFSC are constructed and studied. It is shown that EFSC contains Peano arithmetic PA and is a conservative extension of PA.
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 724110
zbMATH Keywords: elementary theory of finite sets and classes
zbMATH Keywords: predicatively acceptable axiomatization of the natural number system
zbMATH Keywords: Peano arithmetic
reviewed by: Roman Murawski
MaRDI profile type: Publication
cites work: Systems of predicative analysis
cites work: Q5595153
cites work: Q4692959
cites work: Q4001345
cites work: A relative consistency proof
cites work: Fragments of arithmetic
description: scientific article; zbMATH DE number 724110