RR ∈ R?
Set theory · Concept hubDeep story

Russell's Paradox

1901 CE20th-century Britain (Russell)

Concept

Does the set of all sets that do not contain themselves contain itself? Russell's 1901 paradox exposed a contradiction in unrestricted set formation and prompted responses including type theory and axiomatic set theory.

Understand it in one breath

Does the set of all sets that do not contain themselves contain itself, or not? Russell discovered the contradiction in 1901, exposing problems in unrestricted set construction and Frege's Basic Law V. He communicated it to Frege in a letter dated 16 June 1902; later axiomatic set theories imposed explicit constraints on set formation.

At a glance

Assumption

Conclusion

Contradiction?

R = { x : x ∉ x }

R is defined (naive set theory)

R ∈ R

⟹ R ∉ R (by definition)

✗ Contradiction

R ∉ R

⟹ R ∈ R (by definition)

✗ Contradiction

Everyday version: the "barber paradox"

The barber of everyone who does not shave themselves

Does the barber shave himself?

Resolution

Restrict how sets may be defined (axiom schema of separation)

ZFC axioms (1908 onward)

Russell communicated the paradox he had discovered in 1901 in a letter to Frege dated 16 June 1902. Later axiomatic set theories explicitly restricted arbitrary set formation.

Key formula

R={x:xx}    RR    RRR = \{ x : x \notin x \} \;\Longrightarrow\; R \in R \iff R \notin R

Key moments

1901 CE

Discovery of Russell’s paradox

Bertrand Russell found a self-referential contradiction tied to unrestricted set formation and Frege’s Basic Law V.

1908 CE

Zermelo — axiomatic set theory

To block paradoxes such as Russell’s, Zermelo proposed an explicit system of axioms — the beginning of modern Zermelo–Fraenkel set theory.

1910 CE

Principia Mathematica is published

Russell and Alfred North Whitehead began a monumental three-volume attempt to derive mathematics from formal logic; their route to 1+1=2 became famously long.

1931 CE

Gödel — the limits of formalism

Gödel showed that sufficiently strong formal systems, including systems in the Principia tradition, face precise limits on completeness and proving their own consistency.

Modern applications

Type systems that prevent unsafe self-reference, database consistency, and reasoning about self-referential systems in AI.

Beyond MathVoyage

Loading…