Journal of Philosophical Logic 28 (2):165-174 (1999)
Recently, Feferman and Hellman (and Aczel) showed how to establish the existence and categoricity of a natural number system by predicative means given the primitive notion of a finite set of individuals and given also a suitable pairing function operating on individuals. This short paper shows that this existence and categoricity result does not rely (even indirectly) on finite-set induction, thereby sustaining Feferman and Hellman's point in favor of the view that natural number induction can be derived from a very weak fragment of finite-set theory, so weak that finite-set induction is not assumed. Many basic features of finiteness fail to hold in these weak fragments, conspicuously the principle that finite sets are in one-one correspondence with a proper initial segments of a (any) natural number structure. In the last part of the paper, we propose two prima facie evident principles for finite sets that, when added to these fragments, entail this principle
|Keywords||foundations of arithmetic predicativism finiteness natural numbers induction|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
The Foundations of Arithmetic in Finite Bounded Zermelo Set Theory.Richard Pettigrew - 2010 - Cahiers du Centre de Logique 17:99-118.
An Induction Principle and Pigeonhole Principles for K-Finite Sets.Andreas Blass - 1995 - Journal of Symbolic Logic 60 (4):1186-1193.
Predicative Fragments of Frege Arithmetic.Øystein Linnebo - 2004 - Bulletin of Symbolic Logic 10 (2):153-174.
Some Closure Properties of Finite Definitions.Maricarmen Martinez - 2001 - Studia Logica 68 (1):43-68.
Added to index2009-01-28
Total downloads26 ( #191,761 of 2,152,270 )
Recent downloads (6 months)8 ( #89,856 of 2,152,270 )
How can I increase my downloads?