🔢 mathematics

Further Comments on Yablo's Construction

This paper provides a more systematic continuation of the author's previous analysis regarding Yablo's coding of the liar paradox using infinite acyclic graphs.

Original authors: Karl Schlechta

Published 2026-03-17

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Karl Schlechta

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: The Infinite Paradox

Imagine you are trying to build a machine that creates a logical paradox—a statement that is neither true nor false, but stuck in a state of "glitch."

In 1982, a philosopher named Stephen Yablo came up with a famous puzzle. Instead of a single liar saying, "I am lying" (which is a simple loop), Yablo created an infinite line of people.

Person #1 says: "Everyone behind me is lying."
Person #2 says: "Everyone behind me is lying."
Person #3 says: "Everyone behind me is lying."
...and so on, forever.

If Person #1 is telling the truth, then Person #2 must be lying. But if Person #2 is lying, then someone behind them must be telling the truth. It creates a chain reaction where no one can be consistently True or False. They all end up in a "glitch" state (which the author calls $\xi$ ).

Karl Schlechta's paper asks a simple question:

"Is Yablo's specific line of people the only way to build this glitch? Or are there other shapes, patterns, or structures that can create the same infinite paradox?"

The answer he gives is a definitive "No, there aren't." He proves that if you find any complex structure that creates this glitch, it secretly contains Yablo's original line of people inside it. Yablo's structure is the "DNA" of all such paradoxes.

The Building Blocks: The "Yablo Triangle"

To understand the proof, imagine you are an architect trying to build a building that collapses under its own weight (a logical contradiction).

Schlechta breaks down all possible "collapsing structures" into small, basic units called Cells.

The Trivial Cell (The Dead End):
Imagine a room with a door that says "This door is locked" and another that says "This door is unlocked." If you try to walk through, you get stuck immediately. But, you can just walk around the building and find a back door that works. This is a "weak" paradox because there is an escape route.
The Diamond (The Fork in the Road):
Imagine a path that splits into two, then merges back together.
- Path A says: "Go Left."
- Path B says: "Go Right."
- They meet at a point where you have to be both Left and Right.
- The Problem: To make this work, the two paths have to "synchronize" perfectly. They have to agree on exactly when to switch. Schlechta argues that in a pure logical system without outside help, you can't force this synchronization. The "Diamond" shape is too fragile; it breaks easily.
The Yablo Triangle (The Perfect Trap):
This is the winner. It looks like a triangle where:
- Point A points to B.
- Point B points to C.
- Point A also points directly to C.
- But here's the catch: The arrows are "negative." A says "B is a liar," B says "C is a liar," and A also says "C is a liar."
- If you try to escape, you just run into another version of the same triangle. There is no back door. There is no synchronization needed. It is a self-contained trap.

The Conclusion of the Paper:
Schlechta proves that if you want to build a paradox that has no escape routes, you must use the "Yablo Triangle." Any other shape you try to build will either have a back door (an escape) or will secretly be made of Yablo Triangles glued together.

The Construction: Building the Infinite Machine

The paper describes how to glue these triangles together to build the infinite structure.

Imagine you are building a tower of blocks, but every time you place a block, it creates a new problem that needs fixing.

Step 1: You place Block A. It creates a contradiction.
Step 2: To fix the contradiction, you add Block B. But adding Block B creates a new contradiction elsewhere.
Step 3: You add Block C to fix the new problem. But that creates a problem for Block A again.
The Limit: You keep doing this forever. You never finish. You just keep adding layers.

Schlechta shows that this "infinite layering" is the only way to satisfy the conditions. You can't stop at a finite number of blocks; the paradox requires infinite depth and width.

He calls this process satisfying "Antagonistic Requirements."

Requirement 1: The system must be broken if you assume it's True.
Requirement 2: The system must be broken if you assume it's False.
The Strategy: You fix Requirement 1, which breaks Requirement 2. You fix Requirement 2, which breaks Requirement 1. You keep doing this forever until, in the "limit" (infinity), the system is broken in both ways simultaneously.

The "DNA" Test: Why Yablo is Minimal

The most important part of the paper is the Main Result (Section 4).

Schlechta says: "If you hand me a complex, messy, tangled graph that creates a paradox, I can look inside it and find a hidden copy of Yablo's original line of people."

The Analogy:
Imagine you find a strange, complex machine that stops working. You open it up and find it's made of gears, springs, and wires.
Schlechta's theorem says: "No matter how complex this machine looks, if it stops working in this specific way, it must contain a specific, simple gear mechanism inside it. You can't build this machine without that specific gear."

He proves that Yablo's structure is minimal. It is the smallest, simplest "seed" that grows into any paradox of this type. Any other structure is just Yablo's structure with extra decorations or longer paths, but the core logic is identical.

Summary in One Sentence

Karl Schlechta proves that Yablo's infinite line of liars is the fundamental "atom" of logical paradoxes; if you find any other structure that creates a similar "glitch," it is secretly built out of Yablo's structure, and there is no simpler or different way to create it.

1. Problem Statement

The paper addresses the logical and graph-theoretical conditions required to construct a system where a specific node $x$ (and its negation $\neg x$ ) is inconsistent (neither $x$ nor $\neg x$ can be consistently assigned a truth value). In the context of non-classical logic, this state is denoted by a third truth value, $\xi$ (where $|x| = \xi$ ).

The core problem is to determine the minimal structural requirements for an acyclic directed graph to exhibit this paradoxical behavior. Specifically, the author investigates:

What are the fundamental "cells" (subgraphs) that generate such contradictions?
How must these cells be combined to ensure no "escape paths" (consistent valuations) exist?
Is Yablo's original infinite construction (an infinite sequence of nodes where each node asserts the falsity of all subsequent nodes) the unique or minimal structure capable of producing this result?

2. Methodology

The author employs a rigorous combination of graph theory and propositional logic to analyze the construction of paradoxes.

Framework: The analysis is restricted to acyclic directed graphs. Nodes represent propositional variables, and edges represent logical dependencies.
- A negative edge ( $x \not\to y$ ) implies $y$ occurs negatively in the formula for $x$ (e.g., $x \leftrightarrow \neg y$ ).
- A positive edge ( $x \to y$ ) implies $y$ occurs positively.
Truth Values: The system utilizes a three-valued logic:
- $T$ (True), $F$ (False), and $\xi$ (Inconsistent/Paradoxical).
- $\xi$ is defined such that $|x| = \xi$ iff both $x$ and $\neg x$ lead to contradictions within the theory of the graph.
- The logic follows Strong Kleene logic ( $K_s$ ), where $\neg \xi = \xi$ , and operations are defined by min/max over the order $F < \xi < T$ .
Strategy of Inductive Construction:
- The paper analyzes the "antagonistic requirements" (C1 and C2):
  - (C1): If $x$ is assumed True, it must lead to a contradiction.
  - (C2): If $x$ is assumed False (i.e., $\neg x$ is True), it must also lead to a contradiction.
- The author demonstrates that satisfying these conditions in a finite graph is impossible (due to classical logic constraints) and requires an infinite depth and width construction.
- The method involves an inductive step-by-step construction (similar to Yablo's original proof) where solving a contradiction for one branch creates new branches that must also be resolved, leading to an infinite regress.

3. Key Contributions

A. Analysis of Elementary Cells

The paper systematically categorizes potential "contradiction cells" (minimal subgraphs causing inconsistency):

Trivial Contradiction ( $x = y \land \neg y$ ): Rejected because it allows an "escape path" (a consistent valuation exists where the contradiction is avoided).
Diamond Structures: Rejected. The author argues that diamonds (two paths from $x$ to $z$ via different intermediate nodes) require "synchronization" of choices at the intermediate nodes to force a contradiction. Since the framework relies on independent propositional variables without external synchronization mechanisms, diamonds cannot guarantee inconsistency.
Yablo Cells (Triangles): Identified as the only viable elementary cell.
- Structure: $x \not\to y \not\to z$ and $x \not\to z$ .
- Logic: $x \leftrightarrow \neg y \land \neg z$ and $y \leftrightarrow \neg z$ .
- The paper proves that for a cell to be effective, all sides must be negative (involving negation). Any positive edge introduces an "OR" branching that allows for escape paths.

B. Necessity of Infinite Branching

The author proves that replacing infinite branching with a sequence of finite branching points (an infinite chain of finite choices) fails.

Escape Paths: In a finitely branching structure, one can always select a specific "escape branch" that avoids the contradiction.
Conclusion: True inconsistency ( $\xi$ ) in this framework strictly requires infinite width (infinite branching) or an infinite sequence of choices that cannot be fully traversed without hitting a contradiction.

C. Minimality of Yablo's Construction

The paper establishes that Yablo's original structure is minimal.

Any graph containing a node $x$ with value $\xi$ must contain a subgraph that is structurally equivalent to an injection of the Yablo structure.
Even if a graph uses paths instead of single arrows or contains complex "Saw Blade" variations, these structures essentially contain the Yablo triangle as a core component.

4. Results

The paper presents two main theorems (summarized in Section 4):

Existence (Forward Direction):
If a directed acyclic graph $\Gamma$ contains a subgraph that admits a suitable injection from the Yablo structure ($YS$) into $\Gamma$ , and if a partial valuation can be defined on the image of this injection such that contradictions are preserved, then the graph can be extended to a full valuation where some node $x$ has the value $\xi$ .
- Condition: The injection must preserve the path structure and the "negative" nature of the arrows (if $x \to y$ in $YS$, then $\mu(x)$ must be contradictory to $\mu(y)$ ).
Necessity (Converse Direction):
If a graph $\Gamma$ has a valuation where a node $x$ has value $\xi$ (neither $x$ nor $\neg x$ is consistent), then $\Gamma$ must contain a subgraph that corresponds to an injection of the Yablo structure.
- The proof involves "isolating" the necessary contradictory paths and eliminating "unnecessary" parts of the graph (replacing them with tautologies or contradictions that do not affect the core logic), revealing the underlying Yablo skeleton.

5. Significance

Characterization of Paradoxes: The paper provides a precise graph-theoretical characterization of the Yablo paradox. It moves beyond the specific infinite sequence to define the structural essence of the paradox: it is the Yablo triangle (a specific 3-node negative cycle in logical dependency) repeated infinitely.
Elimination of Alternatives: By rigorously ruling out diamonds, trivial contradictions, and finitely branching approximations, the paper confirms that Yablo's construction is not just a solution, but the minimal and necessary solution for generating this type of inconsistency in acyclic graphs without external theories.
Logical Foundations: The work clarifies the relationship between graph topology (acyclicity, branching) and logical consistency. It demonstrates that the "escape" from paradox in finite systems is a structural feature of acyclicity, and that true paradox ( $\xi$ ) requires a specific, unavoidable infinite structure.
Third Truth Value: The formalization of $\xi$ within the graph framework offers a robust way to model self-referential inconsistencies without collapsing into classical contradiction, aligning with Strong Kleene logic.

In summary, Schlechta's paper proves that Yablo's construction is the unique minimal graph-theoretical structure required to generate a node that is neither true nor false, provided the graph is acyclic and relies solely on internal logical dependencies.