Liar paradox
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
Liar paradox
In philosophy and logic, the liar paradox, known to the ancients as the pseudomenon, encompasses paradoxical statements such as "This sentence is false." or "The next sentence is false. The previous sentence is true." These statements are paradoxical because there is no way to assign them a consistent truth value. Consider that if "This statement is false" is true, then what it says is the case; but what it says is that it is false, hence it is false. On the other hand, if it is false, then what it says is not the case; thus, since it says that it is false, it must be true.
HistoryIn the sixth century BC the philosopher-poet Epimenides, himself a Cretan, reportedly wrote:
The Epimenides paradox is often considered equivalent or interchangeable with the "liar paradox", but they are not the same. The liar paradox is a statement that cannot consistently be true or false, while Epimenides' statement is simply false, as long as there exists at least one Cretan who sometimes tells the truth. It is unlikely that Epimenides intended his words to be understood as a kind of liar paradox, and they were probably only understood as such much later in history. The oldest known version of the liar paradox is instead attributed to the Greek philosopher Eubulides of Miletus who lived in the fourth century BC. It is very unlikely that he knew of Epimenides's words, even if they were intended as a paradox. Eubulides reportedly said:
Variants of the paradoxThe problem of the liar paradox is that it seems to show that common beliefs about truth and falsity actually lead to a contradiction. Sentences can be constructed that cannot consistently be assigned a truth value even though they are completely in accord with grammar and semantic rules. Consider the simplest version of the paradox, the sentence:
If we suppose that the statement is true, everything asserted in it must be true. However, because the statement asserts that it is itself false, it must be false. So the hypothesis that it is true leads to the contradiction that it is false. Yet we cannot conclude that the sentence is false for that hypothesis also leads to contradiction. If the statement is false, then what it says about itself is not true. It says that it is false, so that must not be true. Hence, it is true. Under either hypothesis, we end up concluding that the statement is both true and false. But it has to be either true or false- or so our common intuitions lead us to think- hence there seems to be a contradiction at the heart of our beliefs about truth and falsity. However, that the liar sentence can be shown to be true if it is false and false if it is true has led some to conclude that it is neither true nor false. This response to the paradox is, in effect, to reject the common beliefs about truth and falsity: the claim that every statement has to abide by the principle of bivalence, a concept related to the law of the excluded middle. The proposal that the statement is neither true nor false has given rise to the following, strengthened version of the paradox:
If (B) is neither true nor false, then it must be not true. Since this is what (B) itself states, it means that (B) must be true and so one is led to another paradox. Another reaction to the paradox of (A) is to posit, as Graham Priest has, that the statement follows paraconsistent logic and is both true and false. Nevertheless, even Priest's analysis is susceptible to the following version of the liar:
If (C) is both true and false then it must be true. This means that (C) is only false, since that's what it says, but then it can't be true, and so one is led to another paradox. Non-paradoxesThe statement "I always lie" is often considered to be a version of the liar paradox, but is not actually paradoxical. The false dichotomy of either (1) always lying or always (2) telling the truth makes it seem paradoxical, but the negation of "I always lie" isn't "I never lie", but rather "I sometimes (or always) tell the truth" which is compatible with the truth value of the statement. Possible resolutionsAlfred TarskiAlfred Tarski diagnosed the paradox as arising only in languages that are "semantically closed" by which he meant a language in which it is possible for one sentence to predicate truth (or falsity) of another sentence in the same language (or even of itself). To avoid self-contradiction, it is necessary when discussing truth values to envision levels of languages, each of which can predicate truth (or falsity) only of languages at a lower level. So, when one sentence refers to the truth-value of another, it is semantically higher. The sentence referred to is part of the 'object language,' while the referring sentence is considered to be a part of a 'meta-language' with respect to the object language. It is legitimate for sentences in 'languages' higher on the semantic hierarchy to refer to sentences lower in the 'language' hierarchy, but not the other way around. This prevents a system from becoming self-referential. A.N. PriorA. N. Prior asserts that there is nothing paradoxical about the liar paradox. His claim (which he attributes to Charles S. Peirce and John Buridan) is that every statement includes an implicit assertion of its own truth. Thus, for example, the statement "It is true that two plus two equals four" contains no more information than the statement "two plus two is four," because the phrase "it is true that..." is always implicitly there. And in the self-referential spirit of the Liar Paradox, the phrase "it is true that..." is equivalent to "this whole statement is true and ...". Thus the following two statements are equivalent:
The latter is a simple contradiction of the form "A and not A", and hence is false. There is therefore no paradox because the claim that this two-conjunct Liar is false does not lead to a contradiction. Eugene Mills[1] and Neil Lefebvre and Melissa Schelein[2] present similar answers. However, it has been argued that the interpretation of "this statement is false" should formally be expressed as an equation of the form A = { A = false } rather than a conjunction. In that case the paradox remains, as can be seen by substituting either "true" or "false" into the equation. A contradiction will be observed for either value of A. Saul KripkeSaul Kripke points out that whether a sentence is paradoxical or not can depend upon contingent facts. Suppose that the only thing Smith says about Jones is
Now suppose that Jones says only these three things about Smith:
If the empirical facts are that Smith is a big spender but he is not soft on crime, then both Smith's remark about Jones and Jones's last remark about Smith are paradoxical. Kripke proposes a solution in the following manner. If a statement's truth value is ultimately tied up in some evaluable fact about the world, call that statement "grounded". If not, call that statement "ungrounded". Ungrounded statements do not have a truth value. Liar statements and liar-like statements are ungrounded, and therefore have no truth value. Barwise and EtchemendyJon Barwise and John Etchemendy propose that the liar sentence (which they interpret as synonymous with the Strengthened Liar) is ambiguous. They base this conclusion on a distinction they make between a "denial" and a "negation". If the liar means "It is not the case that this statement is true" then it is denying itself. If it means This statement is not true then it is negating itself. They go on to argue, based on their theory of "situational semantics", that the "denial liar" can be true without contradiction while the "negation liar" can be false without contradiction. Gödel's theoremThe proof of Gödel's incompleteness theorem uses self-referential statements that are similar to the statements at work in the Liar paradox. In the context of a sufficiently strong axiomatic system A of arithmetic:
The statement (1) does not mention truth at all (only provability) but the parallel is clear. Suppose (1) is provable, then what it says of itself, that it is not provable, is not true. But this conclusion is contrary to our supposition, so our supposition that (1) is provable must be false. Suppose the contrary that (1) is not provable, then what it says of itself is true, although we cannot prove it. Therefore, there is no proof that (1) is provable, and there is also no proof that its negation is provable (i.e., there is no proof that it is also unprovable). Whence, A is incomplete because it cannot prove all truths, namely, (1) and its negation. Statements like (1) are called undecidable. We take for granted that all the provable statements of logic and arithmetic are true; Gödel showed that the converse, that all the true statements of a system are provable in that system, is not the case. (This does not mean that all true statements are not provable in some system or other. Additionally, there are systems, such as first-order logic, in which all true statements of the system are provable.) Tarski's indefinability theorem, closely related to Gödel's Theorem, is a more direct application of the Liar Paradox, though there is no actual paradox involved; instead, the "paradox" simply demonstrates that all the true sentences of arithmetic are not arithmetically definable (or that arithmetic cannot define its own truth predicate; or that arithmetic is not "semantically closed"). DialetheismGraham Priest and other logicians have proposed that the liar sentence should be considered to be both true and false, a point of view known as dialetheism. In a dialetheic logic, all statements must be either true, or false, or both. Dialetheism raises its own problems. Chief among these is that since dialetheism recognizes the liar paradox, an intrinsic contradiction, as being true, it must discard the long-recognized principle of ex falso quodlibet, which asserts that any sentence whatsoever can be deduced from a true contradiction. Thus, dialetheism only makes sense in systems that reject ex falso quodlibet. Such logics are called paraconsistent. In popular culture
See alsoNotes
References
External links
bs:Paradoks la?ljivca cs:Paradox lhá?e de:Lügner-Paradox et:Valetaja paradoks es:Paradoja del mentiroso eo:Paradokso de mensoganto fr:Paradoxe du menteur ko:?????? ?? hi:??????????? ??????? is:Ţverstćđa lygarans it:Paradosso del mentitore he:?????? ????? hu:A hazug paradoxona nl:Leugenaarsparadox pl:Paradoks k?amcy pt:Paradoxo do mentiroso ru:???????? ????? sr:???????? ???????? fi:Valehtelijan paradoksi sv:Lögnaren (paradox) uk:???????? ??????? zh:????? Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement