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

LIAR PARADOX

Specialty Definition: LIAR PARADOX

DomainDefinition

Computing

Liar paradox A sentence which asserts its own falsity, e.g. "This sentence is false" or "I am lying". These paradoxical assertions are meaningless in the sense that there is nothing in the world which could serve to either support or refute them. Philosophers, of course, have a great deal more to say on the subject. ["The Liar: an Essay on Truth and Circularity", Jon Barwise and John Etchemendy, Oxford University Press (1987). ISBN 0-19-505944-1 (PBK), Library of Congress BC199.P2B37]. (1995-02-22). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Specialty Definition: Liar paradox

(From Wikipedia, the free Encyclopedia)

The liar paradox, attributed to the Greek philosopher Eubulides of Miletus who lived in the fourth century B.C, is the paradoxical statement

I am lying now.

or

This statement is false.

As opposed to the Epimenides paradox, this statement is indeed paradoxical: assuming that the statement is true, then it must be false; assuming it is false, then it is not false. No truth value can be consistently assigned to the statement.

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 following sentence is true.
The preceding sentence is false.

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:

A proof exists in A that this sentence is false.

If a proof exists using only the axioms in A that the statement is true, then this implies that there is also a proof that the statement is false. Conversely, if a proof exists in A that the statement is false, then this proof is an example showing that the statement is true. Thus, if a proof exists either way, the system is inconsistent, in that a single statement can be proven to be both true and false.

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:

This statement is not true.

If it is neither true nor false, then it is not true, which is what it says, hence it's true, etc. This has led some, notably Graham Priest, to posit that the statement is both true and false. Joachim Bromond (2002) has confuted this third truth value by means of a re-strengthened liar which says:

This statement is only false.

(Priest disagrees. See Priest, forthcoming)

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:

This statement is true.

It's true if it's true and false if it's false, but which is it? There seems to be nothing intrinsic to the proposition which determines whether it is true or false. Its truth value seems radically underdetermined. It can be argued that this implicity leads to a contradiction: It can consistently be treated as true and it can be consistently treated as false. If that is so, then one person can mark it down as true, another as false: but if that is the case, then one and the same proposition is both true and false at the same time, a contradiction. Either that, or it is neither true nor false. But it seems to be perfectly meaningful. So either we must conclude that it's meaningless after all or reject the principle of bivalence, and conclude that indeed some meaningful statements can be neither true nor false. Any adequate solution to the liar will have to resolve its twin sister as well.

Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Liar paradox."

Top     

Anagrams: 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.

Top     

Alternative Orthography: LIAR PARADOX


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)

&#76 &#73 &#65 &#82 &#32 &#80 &#65 &#82 &#65 &#68 &#79 &#88

ISO 10646 (1991-1993) (references)

004C 0049 0041 0052      0050 0041 0052 0041 0044 004F 0058

Encryption (beginner's substitution cypher): (references)

46433552250355235384958

Top     



INDEX

1. Anagrams
2. Orthography
3. Bibliography


  

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