Computational Structuralism†
Authors:
- Volker HalbachVHVolker Halbach
- Leon HorstenLHLeon Horsten
- 1 June 2005
- journal article
- research article
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 13 (2) , 174-186
Abstract
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)Keywords
This publication has 7 references indexed in Scilit:
- How We Learn Mathematical LanguagePhilosophical Review, 1997
- Toward the Limits of the Tennenbaum PhenomenonNotre Dame Journal of Formal Logic, 1997
- Recantation or Any old ω-sequence would do after allPhilosophia Mathematica, 1996
- Open induction, Tennenbaum phenomena, and complexity theory1993
- On the complexity of models of arithmeticThe Journal of Symbolic Logic, 1982
- What Numbers Could not BePhilosophical Review, 1965
- Neubegründung der Mathematik. Erste Mitteilung1935