In 1913, English logician Philip Jourdain presented a deceptively simple puzzle: a card with text on both sides. One side says the other is TRUE. The other says the first is FALSE. Click the card to flip it, then try to assign a consistent truth value. You can't.
Click to flip and follow the logical chain:
Click the card to flip it
Jourdain's Card is a clever disguise for the classic Liar Paradox, split across two statements:
A single self-referential statement:
If true, it's false. If false, it's true. Direct self-reference creates the loop.
Two statements that reference each other:
The paradox is distributed—neither sentence mentions itself, yet together they form a loop.
Jourdain showed that self-reference isn't required for paradox. Mutual reference between multiple statements can create the same logical trap. This has implications for: databases, legal contracts, and formal systems.
The ancient Greek philosopher Eubulides formulates the original Liar: "What I am saying now is a lie." This becomes one of the most studied paradoxes in history.
Philip Jourdain, a British logician and follower of Bertrand Russell, publishes the card paradox. He shows that circular reference between statements creates the same logical trap as direct self-reference.
Kurt Godel uses self-referential techniques similar to the Liar Paradox to prove that any sufficiently powerful formal system contains true statements it cannot prove.
Alan Turing proves that no algorithm can determine whether an arbitrary program will halt, using a self-referential argument reminiscent of these paradoxes.
Circular reference paradoxes like Jourdain's Card have practical consequences:
Jourdain's insight can be extended to arbitrarily long chains:
Same paradox, longer loop. If A is true, then B, then C, then A is false. Contradiction!
Any chain with an odd number of "is false" statements creates a paradox. Even-length chains can have consistent truth values (all true or all false).
Jourdain's Card Paradox teaches us that self-reference is not necessary for paradox.
What matters is the structure of reference—any loop that includes an odd number of negations
will be contradictory.
This simple card anticipated profound 20th-century results about the limits of formal systems.
From Godel's incompleteness theorems to Turing's halting problem, the same basic mechanism—a
statement that undermines itself through a chain of references—appears again and again.
The next time you see circular logic, ask yourself: does the chain close with a negation?
If so, you've found a paradox hiding in plain sight.