This page is keyboard accessible:
• Use Tab, Shift + Tab keys to traverse the main menu. To enter a sub-menu use the Right Arrow key. To leave a sub-menu use the Left Arrow or the Escape key.
• The Enter or the Space key opens the active menu item.
• To skip the menu and move to the main content, press Tab after the page loads to reveal a skip button.
• To get back to the top of the page anytime, press the Home key.
• For more information, click here: Accessibility   Close this tip.

Note: Full functionality of this web page requires JavaScript to be enabled in your browser.

The Drinker Paradox

This paradox can be found in a puzzle book entitled “What Is the Name of this Book?” (Footnote: Raymond Smullyan. What is the Name of this Book? Prentice-Hall. ISBN 0-13-955088-7, 1978 Smullyan, What is the Name of this Book?: Details.) by Raymond Smullyan, who called it the ‘drinking principle’. This is perhaps the origin of this ‘paradox’. The ‘paradox’ is also referenced in some other books (Footnote: Sindy Dunbar, “Logic & Mathematical Paradoxes”, World Technologies, ISBN 13: 9788132343134, 2012 Dunbar, Logic & Mathematical Paradoxes: Details.) (Footnote: Orna Grumberg, Tobias Nipkow, and Christian Pfaller, Formal Logical Methods for System Security and Correctness, IOS Press, ISBN 9781586038434, 2008 Formal Logical Methods: Details.) (Footnote: Martín Escardó and Paulo Oliva, Searchable Sets, Dubuc-Penon Compactness, Omniscience Principles, and the Drinker Paradox Computability in Europe Conference 2010) and articles. (Footnote: Marc Bezem and Dimitri Hendriks Clausification in Coq.) (Footnote: Freek Wiedijk, Mizar Light for HOL Light Conference on Theorem Proving in Higher Order Logics, 2001) (Footnote: Henk Barendregt, The Quest for Correctness in Images of SMC research, 1996)


This paradox is quite different from most paradoxes, since of itself it is not a paradox at all, and it simply is a statement that is not correct. The claim that it is a paradox relies on the insistence that the statement is also a theorem of classical logic. Classical logic is a system that gives a general method of analyzing statements in a logical way. However, one of the crucial differences between statements of natural language and statements of classical logic is that classical logic assumes a fixed, non-changing world, where nothing changes over time. Obviously, in that respect, classical logic does not reflect real world situations that do involve changes over time.


The statement of the paradox is this:

S: “For any pub, there is always a customer in the pub such that, if he is drinking, every customer in the pub is drinking.”


Obviously, we know from real world experience that this is incorrect - and because of that, we would not, by any stretch of the imagination, call the statement S a paradox - we would simply say it is incorrect.


So where does the notion that the statement S is a paradox come from?


It comes from the naïve notion that there is a theorem of classical logic that reflects precisely what the natural language statement S states. This theorem of classical logic can be written as:

T : ∃x, [D(x) ⇒ ∀y, D(y)]

which in English, essentially states:

“There is some x, where, if D applies to x then D applies to every y”.


In classical logic, this statement is precisely the same as:

T : ∃x, [¬D(x) ∨ ∀y, D(y)]

which in English, essentially states:

“There is some x, where, D does not apply to x or D applies to every y”.


Now, in classical logic, everything has a fixed truth value. So, either D applies to every y, or it does not. So, considering the two options:

  1. Suppose that D applies to every y. In that case, the statement T is correct


  1. Suppose that D does not apply to every y. In that case, there must be at least one x where D does not apply, so the statement T is again correct.


In either case, in classical logic, the statement T is correct.


But many people seem to believe that you can apply this theorem of classical logic to the real world situation of people drinking in a pub, where some people may not be drinking and then start drinking. They take the classical theorem of logic

x, [D(x) ⇒ ∀yD(y)]

and say that it does apply to the real world, and they may write it such as this:

x, [Drinking(x) ⇒ ∀yDrinking(y)]

where Drinking(x) means that the person x is drinking.


And yes, taken as a statement of classical logic, this can be proved in classical logic, where Drinking(x) is an abstract concept which has no connection to real world drinking. And in classical logic, every proposition has a fixed truth value, and every proposition must be either true or false, and always remains so. That presents no difficulties when dealing with situations where everything has a fixed truth value, for example, in the case of arithmetic, where 1+1 always equals 2. But in the real world, which is the case with drinkers and pubs, the case of whether a person is, or is not drinking is subject to change over time and does not have a fixed truth value.


So there is no logic in the assertion that this theorem of classical logic means that the natural language statement “For any pub, there is always a customer in the pub such that, if he is drinking, every customer in the pub is drinking” must be true.


The old adage that a little learning is a dangerous thing applies here. Beware of people who call themselves logicians, and who have learned some of the rules of classical logic, and who take it on themselves to tell the rest of the world that they know better than we do as to what we actually mean when we make statements about the real world.






Diverse opinions and criticisms are welcome, but messages that are frivolous, irrelevant or devoid of logical basis will be blocked (comments will be checked before appearing on this site). Difficulties in understanding the site content are usually best addressed by contacting me by e-mail. Note: you will be asked to provide an e-mail address - this will only be used to notify you of replies to your comments - it will never be used for any other purpose, will never be displayed and does not require verification. Comments are common to the entire website, so please indicate what section of the site you are commenting on.


If you cannot see any comments below, it may be that a plug-in on your browser is blocking Disqus comments from loading. Avast anti-virus in particular is known to do this, especially with Internet Explorer and Safari. See Disqus Browser plug-in/extension conflicts or Why isn’t the comment box loading?.



Please wait for comments to load …  


The Lighter Side



Lebesgue Measure

There is now a new page on Lebesgue measure theory and how it is contradictory.



Illogical Assumptions

There is now a new page Halbach and Zhang’s Yablo without Gödel which demonstrates the illogical assumptions used by Halbach and Zhang.



Peter Smith’s ‘Proof’

It has come to my notice that, when asked about the demonstration of the flaw in his proof (see A Fundamental Flaw in an Incompleteness Proof by Peter Smith PDF), Smith refuses to engage in any logical discussion, and instead attempts to deflect attention away from any such discussion. If any other reader has tried to engage with Smith regarding my demonstration of the flaw, I would be interested to know what the outcome was.



Easy Footnotes

I found that making, adding or deleting footnotes in the traditional manner proved to be a major pain. So I developed a different system for footnotes which makes inserting or changing footnotes a doddle. You can check it out at Easy Footnotes for Web Pages (Accessibility friendly).



O’Connor’s “computer checked” proof

I have now added a new section to my paper on Russell O’Connor’s claim of a computer verified incompleteness proof. This shows that the flaw in the proof arises from a reliance on definitions that include unacceptable assumptions - assumptions that are not actually checked by the computer code. See also the new page Representability.



New page on Chaitin’s Constant

There is now a new page on Chaitin’s Constant (Chaitin’s Omega), which demonstrates that Chaitin has failed to prove that it is actually algorithmically irreducible.


Previous Blog Posts  


13 May 2015 Good Math, Bad Math?


30 Apr 2015 The Chinese Room


31 Mar 2015 Cranks and Crackpots


16th Mar 2015 Bishops Dancing with Pixies?


23rd Feb 2015 Artificial Intelligence




For convenience, there are now two pages on this site with links to various material relating to Gödel and the Incompleteness Theorem


– a page with general links:

Gödel Links


– and a page relating specifically to the Gödel mind-machine debate:

Gödel, Minds, and Machines


Printer Friendly


All pages on this website are printer friendly, and will print the main content in a convenient format. Note that the margins are set by your browser print settings.

Note: for some browsers JavaScript must be enabled for this to operate correctly.




Comments on this site are welcome, please see the comment section.


Please note that this web site, like any other is a collection of various statements. Not all of this web site is intended to be factual. Some of it is personal opinion or interpretation.


If you prefer to ask me directly about the material on this site, please send me an e-mail with your query, and I will attempt to reply promptly.


Feedback about site design would also be appreciated so that I can improve the site.


Copyright © James R Meyer 2012 - 2017