Drinker paradox
   HOME

TheInfoList



OR:

The drinker paradox (also known as the drinker's theorem, the drinker's principle, or the drinking principle) is a
theorem In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of t ...
of classical
predicate logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
that can be stated as "There is someone in the pub such that, if he or she is drinking, then everyone in the pub is drinking." It was popularised by the mathematical logician
Raymond Smullyan Raymond Merrill Smullyan (; May 25, 1919 – February 6, 2017) was an American mathematician, magician, concert pianist, logician, Taoist, and philosopher. Born in Far Rockaway, New York, his first career was stage magic. He earned a BSc from ...
, who called it the "drinking principle" in his 1978 book ''What Is the Name of this Book?'' The apparently
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 ...
ical nature of the statement comes from the way it is usually stated in natural language. It seems counterintuitive both that there could be a person who is ''causing'' the others to drink, or that there could be a person such that all through the night that one person were always the ''last'' to drink. The first objection comes from confusing formal "if then" statements with causation (see Correlation does not imply causation or
Relevance logic Relevance logic, also called relevant logic, is a kind of non-classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but ...
for logics that demand relevant relationships between premise and consequent, unlike classical logic assumed here). The formal statement of the theorem is timeless, eliminating the second objection because the person the statement holds true for at one instant is not necessarily the same person it holds true for at any other instant. The formal statement of the theorem is :\exists x\in P.\ (x) \rightarrow \forall y\in P.\ D(y) \, where D is an arbitrary
predicate Predicate or predication may refer to: * Predicate (grammar), in linguistics * Predication (philosophy) * several closely related uses in mathematics and formal logic: **Predicate (mathematical logic) **Propositional function **Finitary relation, o ...
and P is an arbitrary nonempty set.


Proofs

The proof begins by recognizing it is true that either everyone in the pub is drinking, or at least one person in the pub is not drinking. Consequently, there are two cases to consider: # Suppose everyone is drinking. For any particular person, it cannot be wrong to say that ''if that particular person is drinking, then everyone in the pub is drinking''—because everyone is drinking. Because everyone is drinking, then that one person must drink because when ''that person'' drinks ''everybody'' drinks, everybody includes that person. # Otherwise at least one person is not drinking. For any nondrinking person, the statement ''if that particular person is drinking, then everyone in the pub is drinking'' is formally true: its antecedent ("that particular person is drinking") is false, therefore the statement is true due to the nature of material implication in formal logic, which states that "If P, then Q" is always true if P is false. (These kinds of statements are said to be
vacuously true In mathematics and logic, a vacuous truth is a conditional or universal statement (a universal statement that can be converted to a conditional statement) that is true because the antecedent cannot be satisfied. For example, the statement "she d ...
.) A slightly more formal way of expressing the above is to say that, if everybody drinks, then anyone can be the
witness In law, a witness is someone who has knowledge about a matter, whether they have sensed it or are testifying on another witnesses' behalf. In law a witness is someone who, either voluntarily or under compulsion, provides testimonial evidence, e ...
for the validity of the theorem. And if someone does not drink, then that particular non-drinking individual can be the witness to the theorem's validity.


Explanation of paradoxicality

The paradox is ultimately based on the principle of formal logic that the statement A \rightarrow B is true whenever A is false, i.e., any statement follows from a false statement ('' ex falso quodlibet''). What is important to the paradox is that the conditional in classical (and intuitionistic) logic is the
material conditional The material conditional (also known as material implication) is an operation commonly used in logic. When the conditional symbol \rightarrow is interpreted as material implication, a formula P \rightarrow Q is true unless P is true and Q i ...
. It has the property that A \rightarrow B is true only if ''B'' is true or if ''A'' is false (in classical logic, but not
intuitionistic logic Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems ...
, this is also a sufficient condition). So as it was applied here, the statement "if they are drinking, everyone is drinking" was taken to be correct in one case, if everyone was drinking, and in the other case, if they were not drinking—even though their drinking may not have had anything to do with anyone else's drinking.


History and variations

Smullyan in his 1978 book attributes the naming of "The Drinking Principle" to his graduate students. He also discusses variants (obtained by replacing D with other, more dramatic predicates): * "there is a woman on earth such that if she becomes sterile, the whole human race will die out." Smullyan writes that this formulation emerged from a conversation he had with philosopher John Bacon. * A "dual" version of the Principle: "there is at least one person such that if anybody drinks, then he does." As "Smullyan's ‘Drinkers’ principle" or just "Drinkers' principle" it appears in H.P. Barendregt's "The quest for correctness" (1996), accompanied by some machine proofs. Since then it has made regular appearance as an example in publications about
automated reasoning In computer science, in particular in knowledge representation and reasoning and metalogic, the area of automated reasoning is dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer prog ...
; it is sometimes used to contrast the expressiveness of
proof assistants In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human-machine collaboration. This involves some sort of interactive proof editor ...
. Freek Wiedijk. 2001
Mizar Light for HOL Light
In Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '01), Richard J. Boulton and Paul B. Jackson (Eds.). Springer-Verlag, London, UK, 378-394.


Non-empty domain

In the setting with empty domains allowed, the drinker paradox must be formulated as follows: A set P satisfies :\exists x\in P.\ (x) \rightarrow \forall y\in P.\ D(y)\, if and only if it is non-empty. Or in words: :''If and only if there is someone in the pub, there is someone in the pub such that, if they are drinking, then everyone in the pub is drinking''.


See also

*
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 ...
*
Reification (linguistics) Reification in natural language processing refers to where a natural language statement is transformed so actions and events in it become quantifiable variables. For example "John chased the duck furiously" can be transformed into something like ...
*
Temporal logic In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I ...
*
Relevance logic Relevance logic, also called relevant logic, is a kind of non-classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but ...


References

{{Paradoxes Predicate logic Logical paradoxes