Computability, Finiteness and the Standard Model of Arithmetic

, &
In Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics. Cham, Switzerland: Springer International Publishing (2016)
  Copy   BIBTEX

Abstract

This paper investigates the question of how we manage to single out the natural number structure as the intended interpretation of our arithmetical language. Horsten submits that the reference of our arithmetical vocabulary is determined by our knowledge of some principles of arithmetic on the one hand, and by our computational abilities on the other. We argue against such a view and we submit an alternative answer. We single out the structure of natural numbers through our intuition of the absolute notion of finiteness.

Categories

Keywords

Reprint years

DOI

10.1007/978-3-319-31644-4_16

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Formalization, Syntax and the Standard Model of Arithmetic.Luca Bellotti - 2007 - Synthese 154 (2):199-229.
Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets.Alistair H. Lachlan & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):59-72.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
A model for intuitionistic non-standard arithmetic.Ieke Moerdijk - 1995 - Annals of Pure and Applied Logic 73 (1):37-51.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
A standard model of Peano Arithmetic with no conservative elementary extension.Ali Enayat - 2008 - Annals of Pure and Applied Logic 156 (2):308-318.
Definability of Initial Segments.Akito Tsuboi & Saharon Shelah - 2002 - Notre Dame Journal of Formal Logic 43 (2):65-73.
Towards applied theories based on computability logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.
Expanding the additive reduct of a model of Peano arithmetic.Masahiko Murakami & Akito Tsuboi - 2003 - Mathematical Logic Quarterly 49 (4):363-368.
The Philosophical Significance of Tennenbaum’s Theorem.T. Button & P. Smith - 2012 - Philosophia Mathematica 20 (1):114-121.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
A model of ZF + there exists an inaccessible, in which the dedekind cardinals constitute a natural non-standard model of arithmetic.Gershon Sageev - 1981 - Annals of Mathematical Logic 21 (2-3):221-281.
Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.Henryk Kotlarski & Bożena Piekart - 2000 - Mathematical Logic Quarterly 46 (1):111-120.
Omega‐ and Beta‐Models of Alternative Set Theory.Athanassios Tzouvaras - 1994 - Mathematical Logic Quarterly 40 (4):547-569.

Analytics

Added to PP
2019-01-28

Downloads
32 (#488,786)

6 months
13 (#184,769)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Matteo Plebani
Università Degli Studi Di Torino
Massimiliano Carrara
University of Padua
Enrico Martino

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references