Liar Paradox¶

A truth-status contradiction arising when a sentence directly or indirectly says of itself that it is false or not true under sufficiently strong truth principles.

Version: v1 · 2026-10-03 · History
Domain-specific #: 13384
Aliases: Liars Paradox

Core Idea¶

The liar paradox occurs when a sentence says of itself that it is false or not true and a theory's truth principles allow that claim to be applied to the sentence. If “This sentence is false” is true, then it is false; if it is false, its claim of falsity appears true. The contradiction depends on negative truth-status self-reference together with the relevant truth and logical rules, not on self-reference alone.[^{ref-7b5200f19977][}ref-b35ac71f3a8c]

Scope of Application¶

The pattern appears in ordinary-language simple liars, indirect liar cycles, and formal sentences constructed by diagonalization in arithmetic. The formal case underlies Tarski's undefinability argument under an adequate truth schema. These are unlike realizations of the negative self-truth loop, not one historical quotation copied twice.[^{ref-7b5200f19977][}ref-b35ac71f3a8c]

Clarity¶

“False” and “not true” do not behave identically in every theory. Rejecting bivalence can block a simple falsity liar yet leave a strengthened untruth version to answer. A self-referential truth-teller—“This sentence is true”—does not yield the same contradictory toggle. A proposed resolution must therefore name the exact truth predicate, permitted status values, and inferential rules.[^{ref-7b5200f19977][}ref-b35ac71f3a8c]

Manages Complexity¶

The paradox reduces many formulations to four questions: What sentence targets itself? What negative truth status does it assert? Which principle links the truth predicate to that sentence? Which logical step produces incompatibility? This separates constructing the liar from responses such as typed truth hierarchies, truth-value gaps, or nonclassical tolerance of contradiction.[^ref-7b5200f19977]

Abstract Reasoning¶

For a fixed point \(L\) satisfying \(L\leftrightarrow\neg T(\ulcorner L\urcorner)\), an unrestricted truth principle for this sentence gives \(T(\ulcorner L\urcorner)\leftrightarrow L\). Together they imply \(L\leftrightarrow\neg L\) under the stated formal assumptions. A hierarchy blocks same-level truth application; a gap theory changes allowed status assignments. Neither shows that every self-reference is paradoxical.[^{ref-7b5200f19977][}ref-b35ac71f3a8c]

Knowledge Transfer¶

The structure transfers literally from an English self-untruth sentence to a formally diagonalized one: negative truth-status self-targeting plus a truth link remains the engine. It does not transfer merely because a program, picture, or organization refers to itself. Tarski's theorem is a formal consequence under additional hypotheses, not another name for the whole liar family.[^{ref-7b5200f19977][}ref-b35ac71f3a8c]

[^ref-7b5200f19977]: Jc Beall, Michael Glanzberg, Ellie Ripley and Lorenzo Rossi, “Liar Paradox”, The Stanford Encyclopedia of Philosophy, Fall 2026, especially §§1.1–1.3, 2.1–2.3 and 4.1–4.3, directly checked. [^ref-b35ac71f3a8c]: Thomas Bolander, “Self-Reference and Paradox”, The Stanford Encyclopedia of Philosophy, Summer 2025, especially §§1.1, 2.1 and 3.1–3.2, directly checked.

Relationships to Other Abstractions¶

Current abstraction Liar Paradox Domain-specific

Parents (1) — more general patterns this builds on

Liar Paradox is a kind of Paradox Prime

The liar is a specific apparently sound inference from truth principles to incompatible truth-status conclusions.

Hierarchy path (1) — routes to 1 parentless root

Liar Paradox → Paradox

Neighborhood in Abstraction Space¶

Liar Paradox sits in a moderately populated region (57^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Logical Inference, Modality & Conditional Structures (27 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08