A note on finiteness in the predicative foundations of arithmetic
From MaRDI portal
Publication:1288136
\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.
Recommendations
Cites work
Cited in
(10)- Predicative foundations of arithmetic
- Reverse mathematics and Peano categoricity
- A small remark on Hilbert's finitist view of divisibility and Kanovich-Okada-Scedrov's logical analysis of real-time systems
- Challenges to predicative foundations of arithmetic
- scientific article; zbMATH DE number 5778051 (Why is no real title available?)
- scientific article; zbMATH DE number 3931004 (Why is no real title available?)
- scientific article; zbMATH DE number 3999883 (Why is no real title available?)
- A note on equality in finite‐type arithmetic
- scientific article; zbMATH DE number 7297896 (Why is no real title available?)
- Euclidean arithmetic: the finitary theory of finite sets
This page was built for publication: A note on finiteness in the predicative foundations of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288136)
