Skip Navigation

Philosophia Mathematica 2005 13(2):174-186; doi:10.1093/philmat/nki021
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Halbach, V.
Right arrow Articles by Horsten, L.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Philosophia Mathematica (III), Vol. 13 No. 2 © Oxford University Press, 2005, all rights reserved

Computational Structuralism{dagger}

Volker Halbach* and Leon Horsten**

*New College Oxford OX1 3BN, England volker.halbach{at}philosophy.oxford.ac.uk
**Center for Logic and Philosophy of Science, Institute of Philosophy, University of Leuven Kardinaal Mercierplein 2, B-3000 Leuven, Belgium Leon.Horsten{at}hiw.kuleuven.ac.be

According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by (nonstandard) 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.

(Hilbert [1935], p. 163)


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.