Philosophia Mathematica 13 (2):174-186 (2005)

Leon Horsten
Universität Konstanz
According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by models that do not instantiate this structure. Proponents of structuralism have put forward various accounts of how we succeed in fixing one single structure as the intended interpretation of our arithmetical language. We shall look at a proposal that involves Tennenbaum's theorem, which says that any model with addition and multiplication as recursive operations is isomorphic to the standard model of arithmetic. On this account, the intended models of arithmetic are the notation systems with recursive operations on them satisfying the Peano axioms. [A]m Anfang […] ist das Zeichen.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/philmat/nki021
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,008
Through your library

References found in this work BETA

How We Learn Mathematical Language.Vann McGee - 1997 - Philosophical Review 106 (1):35-68.
First Published 1953.Ludvig Wittgenstein - forthcoming - Philosophical Investigations.
On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.

View all 6 references / Add more references

Citations of this work BETA

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
The Innocence of Truth.Cezary Cieśliński - 2015 - Dialectica 69 (1):61-85.
What is a Simulation Model?Juan M. Durán - 2020 - Minds and Machines 30 (3):301-323.

View all 17 citations / Add more citations

Similar books and articles

Recursive Models and the Divisibility Poset.James H. Schmerl - 1998 - Notre Dame Journal of Formal Logic 39 (1):140-148.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Theories of Arithmetics in Finite Models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Structuralism and Isomorphism.Charles McCarty - 2013 - Philosophia Mathematica (1):nkt024.
Structure and Identity.Stewart Shapiro - 2006 - In Fraser MacBride (ed.), Identity and Modality. Oxford University Press. pp. 34--69.
Structuralism's Unpaid Epistemological Debts.Bob Hale - 1996 - Philosophia Mathematica 4 (2):124--47.


Added to PP index

Total views
103 ( #113,562 of 2,505,176 )

Recent downloads (6 months)
1 ( #416,705 of 2,505,176 )

How can I increase my downloads?


My notes