A note on finiteness in the predicative foundations of arithmetic (Q1288136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on finiteness in the predicative foundations of arithmetic |
scientific article; zbMATH DE number 1286054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on finiteness in the predicative foundations of arithmetic |
scientific article; zbMATH DE number 1286054 |
Statements
A note on finiteness in the predicative foundations of arithmetic (English)
0 references
11 May 1999
0 references
\textit{S. Feferman} and \textit{G. Hellman} showed in ``Predicative foundations of arithmetic'' [J. Philos. Log. 24, 1-17 (1995; Zbl 0816.03030)] 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. In the paper under review it is shown that this existence and categoricity result does not rely (even indirectly) on finite-set induction.
0 references
predicativity
0 references
existence and categoricity of a natural number system
0 references
pairing function
0 references
0.8506259918212891
0 references
0.7292642593383789
0 references
