Study smarter with Fiveable
Get study guides, practice questions, and cheatsheets for all your subjects. Join 500,000+ students with a 96% pass rate.
Paradoxes aren't just clever puzzles—they're stress tests for logical systems. When you encounter a paradox in Formal Logic I, you're seeing exactly where our rules of inference, truth conditions, and definitions break down. These breakdowns forced logicians to develop more rigorous foundations, from axiomatic set theory to multi-valued logics. Understanding why each paradox creates a contradiction teaches you more about logical structure than memorizing a hundred valid argument forms.
You're being tested on your ability to identify the mechanism behind each contradiction: Is it self-reference? Vagueness? Unrestricted set formation? Don't just memorize the paradoxes—know what principle each one challenges and how logicians have responded. When an exam question asks you to analyze a novel paradox, you'll need to recognize which family it belongs to and what logical tools address it.
These paradoxes arise when a statement or definition refers back to itself, creating a loop that generates contradiction. The core mechanism is that self-reference allows a statement to assert something about its own truth value or membership conditions.
Compare: Liar Paradox vs. Curry's Paradox—both use self-reference, but the Liar creates local contradiction while Curry's causes global triviality by proving anything. If an FRQ asks about threats to logical systems, Curry's is your strongest example.
These paradoxes expose problems with unrestricted set formation—the naive assumption that any definable collection forms a legitimate set. The mechanism is that certain definitions generate sets whose membership conditions are self-contradictory.
Compare: Russell's Paradox vs. Barber Paradox—same logical structure, but Russell's is unavoidable in naive set theory while the Barber's is merely impossible. The barber just can't exist; Russell's set must exist under naive comprehension axioms.
These paradoxes arise from self-referential definitions involving language, naming, or description. The mechanism involves definitions that reference the very system of definition itself.
Compare: Berry Paradox vs. Grelling–Nelson Paradox—both exploit self-referential definitions in language, but Berry targets definability of numbers while Grelling–Nelson targets classification of predicates. Berry connects more directly to mathematical logic; Grelling–Nelson to philosophy of language.
These paradoxes exploit the absence of sharp boundaries in ordinary predicates. The mechanism is that tolerance principles ("small differences don't matter") combined with transitivity lead to absurd conclusions.
Compare: Sorites Paradox vs. Self-Reference Paradoxes—Sorites doesn't involve self-reference at all; it exploits vagueness in predicates. This is a fundamentally different logical problem requiring different solutions (degree-theoretic approaches rather than hierarchies or type restrictions).
These paradoxes involve knowledge, expectation, and reasoning about what agents can know or predict. The mechanism typically involves self-defeating predictions or knowledge that undermines itself.
Compare: Unexpected Hanging vs. Zeno's Paradoxes—both seem to prove something impossible that clearly happens, but Unexpected Hanging involves epistemic reasoning while Zeno's involves mathematical infinity. Different tools resolve them: epistemology for the former, analysis for the latter.
| Concept | Best Examples |
|---|---|
| Self-reference and truth | Liar Paradox, Epimenides Paradox, Curry's Paradox |
| Set membership contradictions | Russell's Paradox, Barber Paradox |
| Definability limits | Berry Paradox, Grelling–Nelson Paradox |
| Vagueness and borderline cases | Sorites Paradox |
| Epistemic reasoning | Unexpected Hanging Paradox |
| Infinity and continuity | Zeno's Paradoxes |
| Threats to logical systems | Curry's Paradox, Russell's Paradox |
| Natural language problems | Grelling–Nelson Paradox, Berry Paradox |
Which two paradoxes share the same logical structure but differ in whether they threaten formal systems? What makes one "merely impossible" and the other "unavoidable"?
If asked to identify a paradox that challenges bivalence through vagueness rather than self-reference, which paradox would you choose, and what makes it structurally different from the Liar?
Compare Curry's Paradox and the Liar Paradox: both involve self-reference, but why is Curry's considered more dangerous to logical systems?
An FRQ asks you to explain why restricting set comprehension axioms solves Russell's Paradox but wouldn't help with the Sorites Paradox. How would you answer?
Which paradoxes would you cite as evidence that natural language contains features that resist formalization? What specific mechanism do they exploit?