HOME

TheInfoList



OR:

The barber paradox is a
puzzle A puzzle is a game, problem, or toy that tests a person's ingenuity or knowledge. In a puzzle, the solver is expected to put pieces together ( or take them apart) in a logical way, in order to arrive at the correct or fun solution of the puzzl ...
derived from Russell's paradox. It was used by
Bertrand Russell Bertrand Arthur William Russell, 3rd Earl Russell, (18 May 1872 – 2 February 1970) was a British mathematician, philosopher, logician, and public intellectual. He had a considerable influence on mathematics, logic, set theory, linguistics, a ...
as an illustration of the
paradox A paradox is a logically self-contradictory statement or a statement that runs contrary to one's expectation. It is a statement that, despite apparently valid reasoning from true premises, leads to a seemingly self-contradictory or a logically u ...
, though he attributes it to an unnamed person who suggested it to him.''The Philosophy of Logical Atomism'', reprinted in ''The Collected Papers of Bertrand Russell, 1914-19'', Vol 8., p. 228 The puzzle shows that an apparently plausible scenario is logically impossible. Specifically, it describes a barber who is defined such that he both shaves himself and does not shave himself, which implies that no barber exists.


Paradox

The barber is the "one who shaves all those, and those only, who do not shave themselves". The question is, does the barber shave himself? Any answer to this question results in a contradiction: The barber cannot shave himself, as he only shaves those who do ''not'' shave themselves. Thus, if he shaves himself he ceases to be the barber specified. Conversely, if the barber does not shave himself, then he fits into the group of people who would be shaved by the specified barber, and thus, as that barber, he must shave himself. In its original form, this paradox has no solution, as no such barber can exist. The question is a
loaded question A loaded question is a form of complex question that contains a controversial assumption (e.g., a presumption of guilt). Such questions may be used as a rhetorical tool: the question attempts to limit direct replies to be those that serve the qu ...
in that it assumes the existence of a barber who could not exist, which is a vacuous proposition, and hence false. There are other non-paradoxical variations, but those are different.


History

This paradox is often incorrectly attributed to
Bertrand Russell Bertrand Arthur William Russell, 3rd Earl Russell, (18 May 1872 – 2 February 1970) was a British mathematician, philosopher, logician, and public intellectual. He had a considerable influence on mathematics, logic, set theory, linguistics, a ...
(e.g., by Martin Gardner in ''Aha!''). It was suggested to Russell as an alternative form of Russell's paradox, which Russell had devised to show that
set theory Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concern ...
as it was used by
Georg Cantor Georg Ferdinand Ludwig Philipp Cantor ( , ;  – January 6, 1918) was a German mathematician. He played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance o ...
and
Gottlob Frege Friedrich Ludwig Gottlob Frege (; ; 8 November 1848 – 26 July 1925) was a German philosopher, logician, and mathematician. He was a mathematics professor at the University of Jena, and is understood by many to be the father of analytic p ...
contained contradictions. However, Russell denied that the Barber's paradox was an instance of his own: This point is elaborated further under Applied versions of Russell's paradox.


In first-order logic

: (\exists x ) (\text(x) \wedge (\forall y) (\text(y) \implies (\text(x, y) \iff \neg \text(y, y)))) This sentence says that a barber exists. Its
truth value In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values ('' true'' or '' false''). Computing In some pro ...
is false, as the existential clause is unsatisfiable (a contradiction) because of the
universal quantifier In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other ...
(\forall). The universal quantifier will include every single element in the domain, including our infamous barber . So when the value is assigned to , the sentence in the universal quantifier can be rewritten to \text(x,x)\iff \neg \text(x,x), which is an instance of the contradiction a \iff \neg a. Since the sentence is false for that particular value, the entire universal clause is false. Since the existential clause is a conjunction with one operand that is false, the entire sentence is false. Another way to show this is to negate the entire sentence and arrive at a tautology. Nobody is a barber, so there is no solution to the paradox. : (\exists x ) (\text(x) \wedge \bot) : (\exists x ) (\bot) : \bot


See also

*
Cantor's theorem In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set A, the set of all subsets of A, the power set of A, has a strictly greater cardinality than A itself. For finite sets, Cantor's theorem can be ...
*
Gödel's incompleteness theorems Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of in formal axiomatic theories. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the phil ...
*
Halting problem In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a ...
*
List of paradoxes This list includes well known paradoxes, grouped thematically. The grouping is approximate, as paradoxes may fit into more than one category. This list collects only scenarios that have been called a paradox by at least one source and have their ...
*
Double bind A double bind is a dilemma in communication in which an individual (or group) receives two or more reciprocally conflicting messages. In some scenarios (e.g. within families or romantic relationships) this can be emotionally distressing, creati ...


References


External links


Proposition of the Barber's Paradox
* Joyce, Helen

''Plus'', May 2002.

*
Russell's (Barber) paradox explanation in Python
{{Paradoxes Self-referential paradoxes Bertrand Russell Logical paradoxes