Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions

Journal of Philosophical Logic 41 (2):493-503 (2012)
Abstract
Rabern and Rabern (Analysis 68:105–112 2 ) and Uzquiano (Analysis 70:39–44 4 ) have each presented increasingly harder versions of ‘the hardest logic puzzle ever’ (Boolos The Harvard Review of Philosophy 6:62–65 1 ), and each has provided a two-question solution to his predecessor’s puzzle. But Uzquiano’s puzzle is different from the original and different from Rabern and Rabern’s in at least one important respect: it cannot be solved in less than three questions. In this paper we solve Uzquiano’s puzzle in three questions and show why there is no solution in two. Finally, to cement a tradition, we introduce a puzzle of our own
Keywords logic puzzle  information theory  Boolos
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,350
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
George Boolos (1996). The Hardest Logic Puzzle Ever. The Harvard Review of Philosophy 6 (1):62-65.
Citations of this work BETA
Similar books and articles
Analytics

Monthly downloads

Added to index

2011-05-14

Total downloads

66 ( #21,068 of 1,096,707 )

Recent downloads (6 months)

6 ( #39,873 of 1,096,707 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.