Computability, Finiteness and the Standard Model of Arithmetic

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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 (2012) 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.

Cite

CITATION STYLE

APA

Carrara, M., Plebani, M., & Martino, E. (2016). Computability, Finiteness and the Standard Model of Arithmetic. In Boston Studies in the Philosophy and History of Science (Vol. 318, pp. 311–318). Springer Nature. https://doi.org/10.1007/978-3-319-31644-4_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free