Russell's paradox is a paradox in naive set theory that is named after Bertrand Russell, who described it in 1901. German mathematician Ernst Zermelo discovered it in 1898, but did not publish the idea. The paradox highlights some problems that set theory had at the time. When Georg Cantor developed the theory in the 1880s, he already suspected that his theory would lead to such problems.
The paradox is described as follows: Consider a set. This set contains all sets which do not contain themselves. Because this set is also a set, it must be considered whether or not this set contains itself. If it does not, then it is eligible to be placed in itself. If it does, then it should not be included. Thus, a paradox is observed.
This paradox, stemming from a simple set definition, exposed a flaw in set theory and led mathematicians to introduce restrictions on set creation, as described in axiomatic set theory.
About 20 years later, Russell came up with the Barber paradox, which is a way of describing the same problem in a different way. The Barber paradox says: "Suppose there is a barber who shaves all adult men who do not shave themselves." In this case, answering the question of whether the barber shaves himself is impossible. If he does, then he would not, because he "shaves all men who do not shave themselves." Similarly, if he does not, then he would. This leads to a paradox.
|
|---|
| General | |
|---|
Theorems (list) & Paradoxes | |
|---|
| Logics | | Traditional | |
|---|
| Propositional | |
|---|
| Predicate |
- First-order
- Second-order
- Higher-order
- Free
- Quantifiers
- Predicate
- Monadic predicate calculus
|
|---|
|
|---|
| Set theory | | | Types of Sets |
- Countable
- Uncountable
- Empty
- Inhabited
- Singleton
- Finite
- Infinite
- Transitive
- Ultrafilter
- Recursive
- Fuzzy
- Universal
- Universe
- Constructible
- Grothendieck
- Von Neumann
|
|---|
| Maps & Cardinality | |
|---|
| Set theories |
- Zermelo–Fraenkel
- General
- Kripke–Platek
- Morse–Kelley
- Naive
- New Foundations
- Tarski–Grothendieck
- Von Neumann–Bernays–Gödel
- Ackermann
- Constructive
|
|---|
|
|---|
Formal systems (list), Language & Syntax |
- Alphabet
- Arity
- Automata
- Axiom schema
- Expression
- Extension
- by definition
- Conservative
- Relation
- Formation rule
- Grammar
- Formula
- Atomic
- Closed
- Ground
- Open
- Free/bound variable
- Language
- Metalanguage
- Logical connective
- Predicate
- Functional
- Variable
- Propositional variable
- Proof
- Quantifier
- Sentence
- Signature
- String
- Substitution
- Symbol
- Function
- Logical/Constant
- Non-logical
- Variable
- Term
- Theory
| Example axiomatic systems (list) |
- of geometry:
- Euclidean:
- non-Euclidean* of arithmetic:
- Peano
- second-order
- elementary function
- primitive recursive
- Robinson
- Skolem
- of the real numbers
- of Boolean algebras
|
|---|
|
|---|
| Proof theory | |
|---|
| Model theory |
- Truth value
- Interpretation
- Model
- Equivalence
- Finite
- Saturated
- Spectrum
- Submodel
- Non-standard model
- Diagram
- Categorical theory
- Model complete theory
- Satisfiability
- Semantics of logic
- Strength
- Theories of truth
- Semantic
- Tarski's
- Kripke's
- T-schema
- Transfer principle
- Truth predicate
- Type
- Ultraproduct
- Validity
|
|---|
| Computability theory | |
|---|
| Related | |
|---|