The liar paradox is the puzzle of a sentence that says of itself that it is false, such as “This sentence is false.” If it is true, it is false; if it is false, it is true. Known since ancient times and traditionally linked to Epimenides of Crete, who is said to have claimed that all Cretans are liars, it became central to modern logic when Alfred Tarski (1935) concluded from it that a classical language cannot define its own truth predicate.
How it works
Where you see it today
Gödel’s first incompleteness theorem (1931) uses a liar-style sentence that says, in effect, “I am not provable”. It shows that any consistent formal system that can do a certain amount of arithmetic contains statements it can neither prove nor disprove.
Turing’s 1936 work leads to the halting problem: no program can decide, for every program and input, whether it will stop. The standard proof builds a machine that does the opposite of whatever the checker predicts about it, the liar’s move in code.
Because of that limit, no checker can settle every question about every program, including AI-generated code. Practical verification tools therefore work on restricted cases, or report some checks as undecided.
Policies and prompts can trip on self-reference too: an instruction such as “ignore all instructions in this message” leaves a system with no consistent way to obey it. Good rule design avoids rules that judge themselves.
The liar and its relatives
How to use it
- When a rule, metric or prompt refers to itself, check whether obeying it is even possible.
- Separate levels: keep the rules about rules (meta-rules) apart from the rules they govern, as Tarski did with languages.
- Allow an "undecided" outcome in reviews and automated checks instead of forcing every case into pass or fail.
- Treat claims that a system can fully verify itself with care; Gödel and Turing show the limits of self-checking.
- Use the liar as a teaching example for spotting hidden assumptions in an argument.
Self-reference sets hard limits on any system that checks itself, from formal proofs to software verifiers. The Business Engineer view: as AI systems review and grade their own outputs, the useful design move is Tarski’s, keep an independent level that does the checking.
Read: The Feedback Loop Paradox →Explore everything we publish →Related: Barber paradox · Sorites paradox · Zeno's paradox · Critical thinking · Straw man fallacy
Frequently asked questions
What is the liar paradox?
It is the puzzle of a sentence that says it is false: if it is true, it is false, and if it is false, it is true.
Is the Epimenides paradox the same as the liar paradox?
It is the traditional ancestor, but "all Cretans are liars" said by a Cretan is not a strict paradox, because it can simply be false if some Cretan tells the truth.
Has the liar paradox been solved?
There is no agreed solution. Leading approaches split language into levels (Tarski), allow truth-value gaps (Kripke), or accept true contradictions (dialetheism).
Why does the liar paradox matter for computing?
The same self-referential trick proves Gödel's incompleteness theorem and the undecidability of the halting problem, which limit what programs can verify.
Sources
- Beall, Glanzberg, Ripley & Rossi (2026 revision), Liar Paradox, Stanford Encyclopedia of Philosophy
- Raatikainen (2025 revision), Gödel's Incompleteness Theorems, Stanford Encyclopedia of Philosophy
- De Mol (2025 revision), Turing Machines, Stanford Encyclopedia of Philosophy
- Kripke (1975), Outline of a Theory of Truth, Journal of Philosophy
The full guide
The complete explainer, cleaned up and reformatted for mobile.
The Liar Paradox is a self-referential enigma where statements contradict themselves, exemplified by phrases like “This statement is false.” Originating from self-reference, it reveals logical inconsistencies, challenging traditional systems. Proposed solutions include revising logic and semantic analysis. Examples like Epimenides and Quine illustrate the paradox’s complexities.
Key Concepts of the Liar Paradox:
- Self-Reference:
- The Liar Paradox hinges on statements that refer to themselves, creating a loop where the statement describes its own truth or falsity.
- Self-reference introduces complexity and ambiguity, as the statement’s truth value depends on its own content, leading to logical paradoxes.
- Truth and Falsity:
- The Liar Paradox challenges traditional notions of truth and falsity, as the statement “This statement is false” cannot be consistently assigned a truth value without leading to a contradiction.
- Attempts to categorize the statement as true or false result in paradoxical outcomes, undermining the coherence of logical reasoning.
- Semantic and Syntactic Paradoxes:
- The Liar Paradox is a type of semantic paradox, where the meaning of the statement itself leads to contradiction.
- It is also related to syntactic paradoxes, which arise from the structure or grammar of the statement, rather than its semantic content.
Implications of the Liar Paradox:
- Foundations of Logic:
- The Liar Paradox challenges fundamental principles of logic, including the law of non-contradiction and the principle of bivalence, which assert that a statement must be either true or false, but not both.
- Resolving the paradox requires revisiting and refining logical frameworks to accommodate self-reference and avoid logical inconsistencies.
- Philosophical Inquiry:
- The Liar Paradox has sparked extensive philosophical debate about the nature of truth, language, and meaning.
- Philosophers have proposed various solutions to the paradox, ranging from revising logical principles to rejecting self-reference altogether.
- Computational Complexity:
- The Liar Paradox has implications for computer science and computational theory, particularly in the realm of formal systems and artificial intelligence.
- Self-referential statements pose challenges for automated reasoning systems and logical inference engines, highlighting the limitations of formalized reasoning in handling paradoxical situations.
Solutions and Approaches to the Liar Paradox:
- Revision of Logical Principles:
- Some philosophers advocate for revising or extending traditional logical systems to accommodate self-reference and resolve paradoxes like the Liar Paradox.
- Approaches such as paraconsistent logic, dialetheism, and non-classical logics aim to embrace contradictions without sacrificing logical coherence.
- Semantic Strategies:
- Semantic approaches to the Liar Paradox involve analyzing the meaning and reference of self-referential statements to untangle the paradox.
- Formal semantics, model theory, and truth-theoretic approaches seek to clarify the conditions under which statements can be assigned truth values without leading to contradictions.
- Pragmatic Solutions:
- Pragmatic approaches to the Liar Paradox focus on circumventing or defusing the paradox rather than directly resolving it.
- Strategies such as ignoring self-referential statements, treating them as meaningless, or limiting the scope of logical systems can help avoid paradoxical reasoning.
Continuing Debate and Philosophical Significance:
- Ongoing Controversy:
- Despite centuries of scrutiny, the Liar Paradox remains a subject of active debate and inquiry among philosophers, logicians, and mathematicians.
- Resolving the paradox requires grappling with deep philosophical questions about the nature of truth, language, and logic.
- Metaphysical Implications:
- The Liar Paradox raises profound metaphysical questions about the nature of reality and the limits of human understanding.
- It challenges conventional notions of truth and coherence, inviting reflection on the nature of paradox and contradiction in philosophical discourse.
- Epistemological Reflection:
- The Liar Paradox prompts epistemological reflection on the limits of knowledge and rational inquiry.
- It underscores the inherent limitations of formal systems and logical frameworks in capturing the complexity and subtlety of human thought and language.
Case Studies and Variations of the Liar Paradox
To illustrate the complexity and depth of the Liar Paradox, let’s explore a few case studies and variations:
Approaches such as paraconsistent logic, dialetheism, and non-classical logics aim to embrace contradictions without sacrificing logical coherence.
Formal semantics, model theory, and truth-theoretic approaches seek to clarify the conditions under which statements can be assigned truth values without leading to contradictions.
Layout refreshed 7 October 2026. The article text below is unchanged.
Self-referential statements pose challenges for automated reasoning systems and logical inference engines, highlighting the limitations of formalized reasoning in handling paradoxical situations.
While there is no universally accepted solution to the Liar Paradox, it has inspired extensive discussions and led to the development of new approaches to logic and language.
1. Epimenides Paradox
The Epimenides Paradox is a variation of the Liar Paradox named after the ancient Cretan philosopher Epimenides. He famously claimed that “All Cretans are liars.” If he is telling the truth, then he, a Cretan, is lying, so the claim cannot be true. But it can simply be false if at least one Cretan tells the truth, so strictly it is a weaker cousin of the liar rather than a full paradox.
2. Russell’s Paradox
Russell’s Paradox is related to the Liar Paradox and deals with set theory. It asks whether the set of all sets that are not members of themselves is a member of itself. Either answer leads to a contradiction similar to the Liar Paradox. Russell’s Paradox played a crucial role in the development of modern set theory.
3. Tarski’s Hierarchy of Languages
Philosopher Alfred Tarski developed a hierarchy of languages to address self-reference and paradoxes like the Liar Paradox. This hierarchy distinguishes between object language (the language being discussed) and meta — as explored in the interface layer wars reshaping consumer tech — language (the language used to talk about the object language), providing a framework for addressing self-reference without generating paradoxes.
4. Gödel’s Incompleteness Theorems
Kurt Gödel’s Incompleteness Theorems, among the most significant results in mathematical logic, have connections to the Liar Paradox. The first theorem shows that in any consistent formal system that can carry out a certain amount of arithmetic, there are statements that can be neither proved nor disproved within that system, leading to questions about the limits of formal logical systems.
Conclusion
The Liar Paradox is a profound philosophical and logical challenge that has far-reaching implications in various fields. It forces us to confront questions about the nature of truth, language, and self-reference. While there is no universally accepted solution to the Liar Paradox, it has inspired extensive discussions and led to the development of new approaches to logic and language. As an enduring enigma, it continues to captivate the minds of philosophers, logicians, and scholars across disciplines, reminding us of the rich complexities that underlie seemingly simple statements and concepts.
Connected · Liar Paradox
Where to go next from Liar Paradox
Picked for this page by topic. Every link checked live.
The Business Engineer readThe Feedback Loop ParadoxThe job of a startup CEO isn't to build products, it's to unlock valuable feedback loops that cut through market noise and reveal the truth.Read on businessengineer.ai →More on Liar Paradox: Berkson's Paradox & Simpson's Paradox
















