-
Views
-
Cite
Cite
Volker Halbach, Leon Horsten, Computational Structuralism, Philosophia Mathematica, Volume 13, Issue 2, June 2005, Pages 174–186, https://doi.org/10.1093/philmat/nki021
- Share Icon Share
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)