Primitive Recursion and Isaacson’s Thesis

Thought: A Journal of Philosophy 8 (1):4-15 (2019)
  Copy   BIBTEX

Abstract

Although Peano arithmetic is necessarily incomplete, Isaacson argued that it is in a sense conceptually complete: proving a statement of the language of PA that is independent of PA will require conceptual resources beyond those needed to understand PA. This paper gives a test of Isaacon’s thesis. Understanding PA requires understanding the functions of addition and multiplication. It is argued that grasping these primitive recursive functions involves grasping the double ancestral, a generalized version of the ancestral operator. Thus, we can test Isaacon’s thesis by seeing whether when we phrase arithmetic in a context with the double ancestral operator, the result is conservative over PA. This is a stronger version of the test given by Smith, who argued that understanding the predicate “natural number” requires understanding the ancestral operator, but did not investigate what is required to understand the arithmetic functions.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2018-11-29

Downloads
23 (#670,031)

6 months
2 (#1,445,278)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Frege’s Theorem: An Introduction.Richard G. Heck - 1999 - The Harvard Review of Philosophy 7 (1):56-73.
A homogeneous system for formal logic.R. M. Martin - 1943 - Journal of Symbolic Logic 8 (1):1-23.
Some considerations on arithmetical truth and the co-rule.Daniel Isaacson - 1992 - In Michael Detlefsen (ed.), Proof, Logic and Formalization. London, England: Routledge. pp. 94.
On definitional equivalence and related topics.J. Corcoran - 1980 - History and Philosophy of Logic 1:231.

Add more references