Drinker paradox explained

The drinker paradox (also known as the drinker's theorem, the drinker's principle, or the drinking principle) is a theorem of classical predicate logic 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, who called it the "drinking principle" in his 1978 book What Is the Name of this Book?[1]

The apparently paradoxical 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 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

\existsx\inP,[D(x)\forally\inP,D(y)].

where D is an arbitrary predicate 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:[1]

  1. 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.[1]
  2. 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.[1] (These kinds of statements are said to be vacuously true.)

A slightly more formal way of expressing the above is to say that, if everybody drinks, then anyone can be the witness 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.[2]

Explanation of paradoxicality

The paradox is ultimately based on the principle of formal logic that the statement

AB

is true whenever A is false, i.e., any statement follows from a false statement[1] (ex falso quodlibet).

What is important to the paradox is that the conditional in classical (and intuitionistic) logic is the material conditional. It has the property that

AB

is true only if B is true or if A is false (in classical logic, but not intuitionistic logic, 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.[1] He also discusses variants (obtained by replacing D with other, more dramatic predicates):

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.[3] Since then it has made regular appearance as an example in publications about automated reasoning; it is sometimes used to contrast the expressiveness of proof assistants.[4]

Non-empty domain

In the setting with empty domains allowed, the drinker paradox must be formulated as follows:[5]

A set P satisfies

\existsx\inP.[D(x)\forally\inP.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

Notes and References

  1. Book: What is the Name of this Book? The Riddle of Dracula and Other Logical Puzzles. Raymond Smullyan. Raymond Smullyan. Prentice Hall. 1978. 0-13-955088-7. true. chapter 14. How to Prove Anything. (topic) 250. The Drinking Principle. pp. 209-211. registration.
  2. Book: Peter J. Cameron. Peter Cameron (mathematician). Sets, Logic and Categories. 1999. Springer. 978-1-85233-056-9. 91.
  3. Book: Images of SMC Research 1996. 1996. Stichting Mathematisch Centrum. 978-90-6196-462-9. The quest for correctness. H.P. Barendregt. 54–55. 2012-10-27. 2015-07-11. https://web.archive.org/web/20150711081633/http://oai.cwi.nl/oai/asset/13544/13544A.pdf. dead.
  4. 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.
  5. Searchable Sets, Dubuc-Penon Compactness, Omniscience Principles, and the Drinker Paradox . Martín Escardó . Paulo Oliva . Computability in Europe 2010 . 2.