Abstract
Any (1‐) consistent and sufficiently strong system of first‐order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first‐order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a non‐trivial fashion. The extended methods of formal proof must capture the essentials of the so‐called ‘semantical argument’ for the truth of the Gödel sentence. We are concerned to show that the deflationist has at his disposal such extended methods—methods which make no use or mention of a truth‐predicate. This consideration leads us to reassess arguments recently advanced—one by Shapiro and another by Ketland—against the deflationist's account of truth. Their main point of agreement is this: they both adduce the Gödel phenomena as motivating a ‘thick’ notion of truth, rather than the deflationist's ‘thin’ notion. But the so‐called ‘semantical argument’, which appears to involve a ‘thick’ notion of truth, does not really have to be semantical at all. It is, rather, a reflective argument. And the reflections upon a system that are contained therein are deflationarily licit, expressible without explicit use or mention of a truth‐predicate. Thus it would appear that this anti‐deflationist objection fails to establish that there has to be more to truth than mere conformity to the disquotational T‐schema.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.