Academia.eduAcademia.edu

An Analysis of the Liar Paradox

Abstract

It is proposed that "This sentence is not true" may be true under some interpretations and false under others. The revenge challenge given by "This sentence is false in at least one interpretation" is handled through the observation that a sentence is arguable true under all interpretations if and only if it is provable. This makes the revenge challenge equivalent to the one given by "This sentence is not provable." Apart from arguing a link with Gödel's first incompleteness theorem we also argue that the way a Liar sentence may be true under one interpretation and false under another is related to the way a "many-valued function" in mathematics may have more than one value. We set up a mathematical framework where sentences may be given many different interpretations. Examples are also given of how Liar sentences may be given many interpretations in practice depending on the intentions of speakers and how they are understood, and our approach to dealing with Liar sentences is compared to those of others.