Sets · step 13 of 13

Russell’s paradox & naive set theory

Naive set theory assumes unrestricted comprehension: any property defines a set. Russell showed this is inconsistent. Let R = {x : x ∉ x}, the set of all sets that are not members of themselves, and ask whether R ∈ R. Either answer gives its opposite, so no such set exists — and the fix, adopted in ZF, is to allow comprehension only within an existing set.

Practise russell’s paradox & naive set theory free → All Sets subtopics

✓ Unlimited questions · marked criterion by criterion · no card needed

Method: how to approach it

The order below is what examiners expect to see, and each step carries its own marks.

State the candidate setWrite R = {x : x ∉ x} and note this is exactly what unrestricted comprehension permits.
Ask the self-membership questionConsider R ∈ R and derive the consequence from the defining property.
Derive both directionsIf R ∈ R then R satisfies the property, so R ∉ R. If R ∉ R then R satisfies the property, so R ∈ R.
Conclude and locate the blameThe contradiction is unavoidable, so the assumption that R is a set must fail — comprehension itself was the faulty axiom.

Worked example

Show that no set contains exactly those sets which are not members of themselves.

Suppose such a set R exists, so for all x: x ∈ R ⟺ x ∉ x.
Instantiate the equivalence at x = R: R ∈ R ⟺ R ∉ R.
A statement equivalent to its own negation is contradictory.
Hence the assumption fails.

Answer. No such set exists. The instantiation at x = R is the entire argument — it is a diagonal argument in one line.

Where marks get dropped

These are the specific errors that cost credit on russell’s paradox & naive set theory questions — QED's rubric penalises each of them separately.

Thinking the paradox is resolved by declaring R empty. Emptiness does not help — the equivalence still applies at x = R.
Assuming sets cannot contain themselves as a matter of definition. In naive set theory nothing forbids it; foundation is an axiom that must be added.
Confusing this with the barber paradox as though the latter were a mathematical result. It is a helpful analogy, not a proof.

Practise this until it is automatic

Unlimited fresh questions

QED generates new russell’s paradox & naive set theory problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.

Marked like an examiner

Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.

Answer in real notation

A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.

Saved to your library

Every question you generate is kept and re-takeable as a timed exam, and your Sets mastery is tracked so you know when this is exam-ready.

Russell’s paradox & naive set theory — frequently asked questions

How does ZF avoid the paradox?

By replacing unrestricted comprehension with separation: you may only form {x ∈ A : P(x)} for an already-existing set A. Russell’s construction then produces a set that is provably not in A, rather than a contradiction.

Is there a "set of all sets"?

Not in ZF. If V were a set, separation would carve Russell’s set out of it and reproduce the contradiction. Such collections are called proper classes.

Why does this matter outside foundations?

The same self-reference drives the halting problem and Gödel’s incompleteness theorems. Recognising the pattern is why it is taught in a discrete maths course.

The rest of Sets

Set-builder notation, operations, and set identities. Each subtopic below has its own method, worked example and mark-losing traps.

Ready to make russell’s paradox & naive set theory exam-proof?

Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.

Start practising free →