Back to Discover
Curiosity

The Liar's Paradox: When a Sentence Breaks Logic

Tracing the Liar's Paradox shows how a single self-referential claim exposes the assumptions underlying truth, falsity, and self-reference — and why no classical fix can hide the problem forever.

Before you enter

A complete interactive classroom, not just a preview.

Start when you are ready to enter this Stage's 9 scenes and explore, respond, and learn as you go.

9
Scenes
18 min
Estimated
Content language: en-US
Start this Stage
Sign-in may be required to play
What happens inside
  1. 01Meet the Sentence That Eats Itselfslide
    Question

    Introduce 'This statement is false' as a single sentence that forces a choice we cannot safely make.

    • Present the sentence in isolation
    • Frame the binary choice: is it true or false?
    • Establish the driving question for the investigation
  2. 02Make Your First Callquiz
    Prediction

    Ask the learner to commit to a single answer about the truth value of the sentence before any analysis is shown.

    • Force an explicit prediction
    • Surface the learner's prior intuition
    • Create stakes for the evidence that follows
  3. 03Trace the Contradictioninteractive
    Evidence

    Let the learner step through the two cases — assuming the sentence is true, then assuming it is false — and see the contradiction unfold visibly.

    • Case 1: Assume true → must be false
    • Case 2: Assume false → must be true
    • Both cases collapse
  4. 04
    The Hidden Assumptionslide
    Evidence

    Show that the contradiction only arises because the sentence refers to itself and applies the law of excluded middle without restriction.

    • Self-reference is the trigger
    • Truth and falsity are treated as exhaustive opposites
    • The sentence assumes both rules at once
  5. 05Why Logic Has to Break Somethinginteractive
    Explanation

    Let the learner toggle off one of the two assumptions at a time and watch the paradox disappear — proving that one rule must give.

    • Remove self-reference → sentence becomes harmless
    • Remove excluded middle → sentence becomes undecidable
    • Logic cannot keep both and stay consistent
  6. 06What the Paradox Provesslide
    Explanation

    Connect the conclusion to Tarski's theorem: any language strong enough to define its own truth must either ban self-reference or tolerate paradox.

    • Tarski's hierarchy of languages
    • Truth cannot be fully captured inside the system that uses it
    • The Liar's Paradox is a theorem, not a trick
  7. 07Test the Edgesinteractive
    Boundary

    Let the learner try variations — pinning the sentence to a wall, having someone else say it, negating it twice — and see which versions still bite and which are defused.

    • Pinning does not change the logic
    • Attribution to a speaker does not change the logic
    • Double negation still self-refers
  8. 08Where Else This Shows Upslide
    Transfer

    Show that the same shape of problem appears in Gödel's incompleteness theorems and in the liar-style paradoxes that motivated modern logic.

    • Self-reference reappears in arithmetic (Gödel)
    • Formal systems hit the same wall
    • The Liar is the prototype, not an oddity
  9. 09Answering the Driving Questionslide
    Resolution

    Close the investigation by returning to the original sentence and stating exactly what it reveals about logic.

    • Recap: the paradox is not a puzzle, it is a proof
    • Logic must choose between self-reference and total truth
    • The sentence marks the boundary of what classical logic can say
Discussion

Discussion threads for a Stage aren't available yet.

Where this leads
Explore more

More in Math & Logic

See all