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.

Other Versions

No versions found

Similar books and articles

Analytics

Added to PP
2010-08-24

Downloads
259 (#160,961)

6 months
45 (#187,639)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Volker Halbach
Oxford University
Leon Horsten
Universität Konstanz

Citations of this work

What is a Simulation Model?Juan M. Durán - 2020 - Minds and Machines 30 (3):301-323.
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.

View all 22 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