Gödelian sentences, Rosserian sentences and truth
Author:
Assadi Ziba1,
Salehi Saeed2
Affiliation:
1. Independent Scholar, Tabriz, Iran
2. Department of Mathematical Sciences, University of Tabriz, P.O. Box 51666-16471, Tabriz, Iran
Abstract
Abstract
There is a long-standing debate in the logico-philosophical community as to if/why the Gödelian sentences of a consistent and sufficiently strong theory are true ($\gamma $ is a Gödelian sentence of $T$ when $\gamma $ is equivalent to the $T$-unprovability of $\gamma $ inside $T$). The prevalent argument seems to be something like the following: since every one of the Gödelian sentences of such a theory is equivalent to the consistency statement of the theory, even provably so inside the theory, the truth of those sentences follows from the consistency of the theory in question; so, Gödelian sentences of consistent and sufficiently strong theories are true. In this paper, we critically examine this argument and present necessary and sufficient conditions for the truth of Gödelian sentences (and Rosserian sentences) of consistent and sufficiently strong arithmetical theories.
Funder
Iran National Science Foundation
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference40 articles.
1. On “seeing” the truth of the Gödel sentence;Boolos,1990
2. The Logic of Provability
3. Between proof and truth;Boyer;Synthese,2012
4. On axiomatizability within a system;Craig;The Journal of Symbolic Logic,1953
5. How do we know that G is true?;Drăghici;Logos Architekton, Journal of Logic and Philosophy of Science,2012