A set-theoretic paradox showing that unrestricted comprehension (forming the set of all elements satisfying an arbitrary property) leads to contradiction, classically exhibited by the set R = {x | x ∉ x}.

Principle

If any definable collection of objects is a set, then considering the collection of all sets that do not contain themselves produces a membership question about that collection which yields a contradiction when asked 'Does R belong to R?'.

Demonstration

Let R = {x | x ∉ x}. If R ∈ R then by definition R ∉ R; if R ∉ R then by definition R ∈ R. Either answer contradicts the comprehension principle that allowed R to be formed, exposing inconsistency in naive set formation.

Misapplication

Applying unrestricted comprehension in formal set theories or assuming that classes and sets are interchangeable without qualification; or trying to dismiss the paradox as merely linguistic rather than foundational to axiomatic choices.

Consequence

Led to axiomatic remedies: restrict comprehension (separation schema), adopt type theory, or distinguish sets and proper classes; modern set theories (e.g., ZF) avoid the paradox by limiting formation axioms.

Reversal

If comprehension were preserved intact, mathematics would become inconsistent; the reversal is to adopt a hierarchical or typed ontology where the problematic construction is simply ill-formed rather than paradoxical.

Boundary

Concerns naive set theories that permit formation of sets from any property. It does not afflict theories that enforce formation constraints, nor does it apply to contexts where collections are explicitly treated as classes with different rules.

Semantic Tension

Tension between the intuitive idea that any describable collection should be a set and the technical requirement to restrict set formation to prevent contradiction; this pits naive ontology against rigorous axiomatization.

Synthesis

Russell's paradox identifies a boundary in set formation: naive comprehension yields contradiction, so consistent foundational frameworks must restrict set-formation rules (via axioms, types, or class/set distinctions) to preserve consistency.