Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Barber paradox
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== In first-order logic == : <math>(\exists x ) (\text{person}(x) \wedge (\forall y) (\text{person}(y) \implies (\text{shaves}(x, y) \iff \neg \text{shaves}(y, y))))</math> This sentence says that a barber {{mvar|x}} exists. Its [[truth value]] is false, as the existential clause is unsatisfiable (a contradiction) because of the [[Universal quantification|universal quantifier]] <math>(\forall)</math>. The universally quantified {{mvar|y}} will include every single element in the domain, including our infamous barber {{mvar|x}}. So when the value {{mvar|x}} is assigned to {{mvar|y}}, the sentence in the universal quantifier can be rewritten to <math> \text{shaves}(x,x)\iff \neg \text{shaves}(x,x)</math>, which is an instance of the contradiction <math>a \iff \neg a</math>. Since the sentence is false for the biconditional, 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 (logic)|tautology]]. Nobody is such a barber, so there is no solution to the paradox.<ref name=siegelj/><ref name="oxfordref"/> : <math>(\exists x ) (\text{person}(x) \wedge \bot)</math> : <math>(\exists x ) (\bot)</math> : <math>\bot</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)