Synthese 200 (5):1-12 (
2022)
Copy
BIBTEX
Abstract
The present paper focuses on Graham Priest’s claim that even primitive recursive relations may be inconsistent. Although he carefully presented his claim using the expression “may be,” Priest made a definite claim that even numerical equations can be inconsistent. His argument relies heavily on the fact that there is an inconsistent model for arithmetic. After summarizing Priest’s argument for the inconsistent primitive recursive relation, I first discuss the fact that his argument has a weak foundation to explain that the existence of a model for some relations does not guarantee that they are primitive recursive. Moreover, since his identity relation is a combination of a standard identity and a congruence relation, it does not simply represent the standard identity function. Then, I argue that his identity relation cannot be both inconsistent and primitive recursive. Furthermore, I extend the argument to the general case that there is no inconsistent primitive recursive relation. These arguments show that the standard notions of “function” and “primitive recursive function” do not fit Priest’s inconsistent model. New definitions are necessary to show the existence of a dialetheic primitive recursive relation.