Russell's paradox

A Dictionary of Computing | 2004 | 499 words | Copyright

Russell's paradox A contradiction originally formulated by Bertrand Russell and phrased in terms of set theory. Let T be the set of all sets that are not members of themselves, i.e. T = {S | S ∉ S}

Then it can be shown that T is a member of T if and only if T is not a member of T.

The paradox results from certain kinds of recursive definitions. It arises for example in the following situation: the barber in a certain town shaves everyone who does not shave himself; who shaves the barber?

Cite this article
Pick a style below, and copy the text for your bibliography.

MLA
Chicago
APA

JOHN DAINTITH. "Russell's paradox." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "Russell's paradox." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-Russellsparadox.html

JOHN DAINTITH. "Russell's paradox." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-Russellsparadox.html

Learn more about citation styles