Russell's paradox
Part of a convergent series on Mathematics |
1+1=11 |
Russell's paradox is as paradox as follows: Consider the set of all sets which are not members of themselves. Is this set a member of itself? If it is, then it is not. If it is not, then it is. A contradiction ensues. In an interesting application, this can be exploited to preclude the existence of a bijection between any set and its power set.^{} The result is an elegant proof that the cardinality of the latter is always larger.
Bertrand Russell's paradox is a consequence of the axiom of comprehension and the existence of a universal set. Hence, in ZF set theory, the universal set does not exist. Alternatively, one could avoid Russell's paradox and retain a universal set by rejecting the axiom of comprehension.
Another version of this paradox goes: Does a barber, who shaves all those and only those who do not shave themselves, shave himself? If he shaves himself, then he is not one of those who do not shave themselves, and since he only shaves those who do not shave themselves, then he does not shave himself. If he doesn't shave himself, then he is one of the those who do not shave themselves, and since he shaves all those who do not shave themselves, then he shaves himself.
This can also be considered more practically via ledgers that track books in a library. One ledger might list all books about geology. Another ledger might list all history books. Another ledger might keep track of all ledgers that cover books about animals. Imagine an uber-ledger that lists all ledgers that do not list themselves. Based on that criteria, should the uber-ledger list itself?
See also[edit]
External links[edit]
- Russell's Paradox at Stanford Encyclopedia of Philosophy
- Russell's Paradox at Internet Encyclopedia of Philosophy