Mind 111 (444):817-832 (2002)
|Abstract||He argues that the intuitively provable arithmetic sentences constitute a recursively enumerable set, which has a Gödel sentence which is itself intuitively provable. The incompleteness theorem does not apply, since the set of provable arithmetic sentences is not consistent. The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, consensus, or Church's thesis. We add Priest's dialetheic semantics to ordinary Peano arithmetic PA, to produce a recursively axiomatized formal system PA that contains its own truth predicate. Whether one is a dialetheist or not, PA is a legitimate, rigorously defined formal system, and one can explore its proof-theoretic properties. The system is inconsistent (but presumably non-trivial), and it proves its own Gödel sentence as well as its own soundness. Although this much is perhaps welcome to the dialetheist, it has some untoward consequences. There are purely arithmetic (indeed, 0) sentences that are both provable and refutable in PA. So if the dialetheist maintains that PA is sound, then he must hold that there are true contradictions in the most elementary language of arithmetic. Moreover, the thorough dialetheist must hold that there is a number g which both is and is not the code of a derivation of the indicated Gödel sentence of PA. For the thorough dialetheist, it follows ordinary PA and even Robinson arithmetic are themselves inconsistent theories. I argue that this is a bitter pill for the dialetheist to swallow.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Aldo Ursini (1978). On the Set of 'Meaningful' Sentences of Arithmetic. Studia Logica 37 (3):237 - 241.
Robert F. Hadley (2008). Consistency, Turing Computability and Gödel's First Incompleteness Theorem. Minds and Machines 18 (1):1-15.
John R. Lucas (1961). Minds, Machines and Godel. Philosophy 36 (April-July):112-127.
Francesco Berto (2009). There's Something About Gödel: The Complete Guide to the Incompleteness Theorem. Wiley-Blackwell.
Philip Hugly & Charles Sayward (1989). Can There Be a Proof That an Unprovable Sentence of Arithmetic is True? Dialectica 43 (43):289-292.
Francesco Berto (2009). The Gödel Paradox and Wittgenstein's Reasons. Philosophia Mathematica 17 (2):208-219.
Raymond M. Smullyan (1985). Uniform Self-Reference. Studia Logica 44 (4):439 - 445.
Laureano Luna & Alex Blum (2008). Arithmetic and Logic Incompleteness: The Link. The Reasoner 2 (3):6.
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
Added to index2009-01-28
Total downloads44 ( #29,783 of 722,813 )
Recent downloads (6 months)1 ( #60,541 of 722,813 )
How can I increase my downloads?