Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Liar paradox |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
Even the conclusion that the statement is neither true nor false leads to a contradiction: the statement claims to be false, but isn't, so it claims a falsehood and is therefore false.
To avoid having a sentence refer to its own truth value, one can also construct the paradox
The proof of Gödel's incompleteness theorem essentially consists of a formally correct formulation of a variation of this paradox in the context of a sufficiently strong axiomatic system A:
On the other hand, if there exists no proof in A of the statement either way, then no contradiction arises. The system A is called incomplete in this case: there exists a statement which can neither be proven nor disproven in A.
Similarly, by using the statement "No proof exists in A that this statement is true", we can see that in a consistent system there are statements that are "clearly" true, which cannot be proven to be so in A.
That A 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 has given rise to the following, strengthened version of the paradox:
Then there's Yablo's version of the paradox. Consider a list of sentences which is infinitely long in both directions. The sentences all say the same thing : All of the subsequent statements are false. Pick one statement at random. So it's true if all of the subsequent statements are false. But if all of the subsequent statements are false, then what they say is case: they say that all of the subsequent statements are false, and ex hyposthesi they are false. So like the liar, they're true if they're false and false if they're true, yet no propositions predicate falsity of themselves. This is sufficent to prove that the liar does not depend upon self reference.
Consider for a moment the opposite of the liar:
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Liar paradox."
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-a-a-d-i-l-o-p-r-r-x" | |
-3 letters: railroad. | |
-4 letters: adaxial, airdrop, apraxia, dipolar, parador, paradox. | |
-5 letters: alodia, apodal, parlor, parral, prolix, radial. | |
| Words containing the letters "a-a-a-d-i-l-o-p-r-r-x" | |
+5 letters: ultraparadoxical. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4C 49 41 52      50 41 52 41 44 4F 58 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001100 01001001 01000001 01010010 00100000 01010000 01000001 01010010 01000001 01000100 01001111 01011000 |
HTML Code (1990) (references)L I A R   P A R A D O X |
ISO 10646 (1991-1993) (references)004C 0049 0041 0052      0050 0041 0052 0041 0044 004F 0058 |
Encryption (beginner's substitution cypher): (references)46433552250355235384958 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.