.png){kind=icon}
.png){kind=icon}
Return
Structure and Computation
.png){kind=icon}
OA
AI
DOI：10.1111/nous.70023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure. In this paper, I challenge this truism by showing that isomorphic systems can differ with regard to important computational features of numbers. This confronts arithmetical structuralists with a dilemma. On the one hand, many computability-theoretic properties are only satisfied by particular number systems, and are hence disqualified as irrelevant by structuralist accounts. On the other hand, these properties turn out to be highly relevant to arithmetical practice. Hence, as I argue, arithmetical structuralism is not a tenable view about arithmetic.
Keywords:
computability
philosophy of mathematics
structuralism
structure of arithmetic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.