Copyright © James R Meyer 2012 - 2016 www.jamesrmeyer.com
The Liar paradox is a statement such as:
This sentence is false.
The reasoning that makes this paradoxical is this:
If ‘This sentence is false.’ is true, then since it is stating that the sentence is false, if it is actually true that would mean that it is false, and so on.
Or, if ‘This sentence is false.’ is false, then since the sentence is stating that the sentence is false, if it is actually false that would mean that it is true, and so on.
If we assume that the ‘this’ does actually refer to the sentence it occurs in, if we try to substitute ‘this sentence’ by ‘This sentence is false’, we simply get:
‘This sentence is false’ is false.
and we can repeat the process, giving:
‘ ‘This sentence is false’ is false’ is false.
and so on, and there is no end to this process.
Because of this, the Liar paradox, as well as a host of similar paradoxes are commonly called ‘self-referencing’ or ‘circular’ paradoxes.
To see what is happening in the Liar paradox, it may be easier to first consider the following sentence:
This sentence has twelve letters.
Is the above sentence correct or incorrect? Because of the ambiguity of English, there is no definitive answer. On the one hand you could consider that the sentence is stating that “This sentence” is an object that contains twelve letters - in which case you would say that the sentence is correct. On the other hand, you could consider that “This sentence” is a name that refers to the expression “This sentence has twelve letters.” - and conclude that the sentence is incorrect.
Note that in either case, the reference is to an object, and the expression makes a statement, ‘has twelve letters’, regarding that object. The first case, where the object is “This sentence”, is straightforward. In the second case, however, “This sentence” is a name - but the thing that it refers to is also an object. The result is that the overall expression, “This sentence has twelve letters.” is at the same time an object in English, and also valid syntax of English.
Natural languages such as English have this characteristic that allows such self-referential sentences. In terms of a meta-language and a sub-language, English sentences such as the one above can be considered to be a mixture of two levels of language which cannot be separated into meta-language and sub-language, and because of that, they do not form logically valid propositions.
Bearing the above in mind, then for the case of the Liar paradox,
This sentence is false.
if we reject the possibility that the sentence is stating that the actual combination of symbols that is “This sentence” is false, that the only other possibility is that “This sentence” is a name, and the object that it refers to is “This sentence is false.”, so that “This sentence is false.” is at the same time an object in English, and also valid syntax of English - which means that the expression is not a logically valid proposition.
Various authors have suggested ‘solutions’ to such paradoxes, but the simple answer is that there is no solution to such paradoxes as long as a natural language such as English is being used - since the paradox arises from the ambiguity of natural language that allows symbols strings to be at the same time, objects of the language, and valid syntax of the language. Note that quotation marks (as used above) are often used as delimiters in an attempt to clarify when we are referring to a symbol string as an object, but they do not prevent the ambiguity that results from the mixture of meta-language and sub-language that occur in natural languages such as English. That ambiguity is the price we pay for the flexibility of natural language. An example of an failed attempt to construct a logically valid version of the lair paradox by using quotation marks can be seen on the webpage Quine’s Paradox.
In numerous incompleteness proofs, you will find the notion that a language A whose only objects are numbers is allegedly referring to its own formulas when it refers to numbers - because a meta-language has assigned numbers as names for the formulas of that language A. Of course, this notion is nonsensical, since the language A has no information regarding these names, since that information is not within that language A, but within a meta-language. Despite this obvious obstacle, such incompleteness proofs are accepted as valid proofs, although logical analysis always reveals some flaw in the proof. See Errors in incompleteness proofs and Analysis of incompleteness proofs.
Diverse opinions and criticisms are welcome, but messages that are frivolous, irrelevant or devoid of logical basis will be blocked (comments will be checked before appearing on this site). Difficulties in understanding the site content are usually best addressed by contacting me by e-mail. Note: you will be asked to provide an e-mail address - this will only be used to notify you of replies to your comments - it will never be used for any other purpose, will never be displayed and does not require verification. Comments are common to the entire website, so please indicate what section of the site you are commenting on.
If you cannot see any comments below, it may be that a plug-in on your browser is blocking Disqus comments from loading. Avast anti-virus in particular is known to do this, especially with Internet Explorer and Safari. See Disqus Browser plug-in/extension conflicts or Why isn’t the comment box loading?.
Please wait for comments to load …
There is a new addition to the page Yet another flawed incompleteness proof, where Berto’s proof of incompleteness in his book There’s something about Gödel comes under scrutiny.
I found that making, adding or deleting footnotes in the traditional manner proved to be a major pain. So I developed a different system for footnotes which makes inserting or changing footnotes a doddle. You can check it out at Easy Footnotes for Web Pages (Accessibility friendly).
I have now added a new section to my paper on Russell O’Connor’s claim of a computer verified incompleteness proof. This shows that the flaw in the proof arises from a reliance on definitions that include unacceptable assumptions - assumptions that are not actually checked by the computer code. See also the new page Representability.
There is now a new page on Chaitin’s Constant (Chaitin’s Omega), which demonstrates that Chaitin has failed to prove that it is actually algorithmically irreducible.
For convenience, there are now two pages on this site with links to various material relating to Gödel and the Incompleteness Theorem
– a page with general links:
– and a page relating specifically to the Gödel mind-machine debate:
All pages on this website are printer friendly, and will print the main content in a convenient format. Note that the margins are set by your browser print settings.
Comments on this site are welcome, please see the comment section.
Please note that this web site, like any other is a collection of various statements. Not all of this web site is intended to be factual. Some of it is personal opinion or interpretation.
If you prefer to ask me directly about the material on this site, please send me an e-mail with your query, and I will attempt to reply promptly.
Feedback about site design would also be appreciated so that I can improve the site.
Copyright © James R Meyer 2012 - 2016