On the Behavior of True and False
- Stefan Wintein
- … show all 1 hide
Uzquiano (Analysis 70:39–44, 2010) showed that the Hardest Logic Puzzle Ever (HLPE) [in its amended form due to Rabern and Rabern (Analysis 68:105–112, 2008)] has a solution in only two questions. Uzquiano concludes his paper by noting that his solution strategy naturally suggests a harder variation of the puzzle which, as he remarks, he does not know how to solve in two questions. Wheeler and Barahona (J Philos Logic, to appear, 2011) formulated a three question solution to Uzquiano’s puzzle and gave an information theoretic argument to establish that a two question solution for Uzquiano’s puzzle does not exist. However, their argument crucially relies on a certain conception of what it means to answer self-referential yes–no questions truly and falsely. We propose an alternative such conception which, as we show, allows one to solve Uzquiano’s puzzle in two questions. The solution strategy adopted suggests an even harder variation of Uzquiano’s puzzle which, as we will show, can also be solved in two questions. Just as all previous solutions to versions of HLPE, our solution is presented informally. The second part of the paper investigates the prospects of formally representing solutions to HLPE by exploiting theories of truth.
- Beall, J. (2009) Spandrels of truth. Oxford University Press, Oxford CrossRef
- Boolos, G. (1996) The hardest logic puzzle ever. The Harvard Review of Philosophy 6: pp. 62-65
- Field, H. (2008) Saving truth from paradox. Oxford University Press, Oxford CrossRef
- Gaifman, H. (1992) Pointers to truth. Journal of Philosophy 89: pp. 223-261 CrossRef
- Gupta, A., Belnap, N. (1993) The revision theory of truth. MIT Press, Cambridge
- Kripke, S. (1975) Outline of a theory of truth. Journal of Philosophy 72: pp. 690-716 CrossRef
- Rabern, B., Rabern, L. (2008) A simple solution to the hardest logic puzzle ever. Analysis 68: pp. 105-112
- Rabern, B., & Rabern, L. (2009). In defense of the two question solution to the hardest logic puzzle ever. Unpublished.
- Roberts, T. (2001) Some thoughts about the hardest logic puzzle ever. Journal of Philosophical Logic 30: pp. 609-612 CrossRef
- Uzquiano, G. (2010) How to solve the hardest logic puzzle ever in two questions. Analysis 70: pp. 39-44 CrossRef
- Wheeler, G., & Barahona, P. (2011). Why the hardest logic puzzle ever cannot be solved in less than three questions. Journal of Philosophical Logic (to appear).
- On the Behavior of True and False
- Open Access
- Available under Open Access This content is freely available online to anyone, anywhere at any time.
Minds and Machines
Volume 22, Issue 1 , pp 1-24
- Cover Date
- Print ISSN
- Online ISSN
- Springer Netherlands
- Additional Links
- Hardest logic puzzle ever
- Stefan Wintein (1)
- Author Affiliations
- 1. Department Wijsbegeerte and TiLPS, Universiteit van Tilburg, Warandelaan 2, Gebouw D136, 5000 LE, Tilburg, The Netherlands