Computational Structuralism &dagger

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

Abstract

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.

Links

PhilArchive



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

External links

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

Through your library

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.

Analytics

Added to PP
2010-08-24

Downloads
127 (#142,329)

6 months
10 (#261,437)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Leon Horsten
Universität Konstanz
Volker Halbach
Oxford University

Citations of this work

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

View all 20 citations / Add more citations

References found in this work

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