How to solve the hardest logic puzzle ever in two questions

Analysis 70 (1):39-44 (2010)
Rabern and Rabern (2008) have noted the need to modify `the hardest logic puzzle ever’ as presented in Boolos 1996 in order to avoid trivialization. Their paper ends with a two-question solution to the original puzzle, which does not carry over to the amended puzzle. The purpose of this note is to offer a two-question solution to the latter puzzle, which is, after all, the one with a claim to being the hardest logic puzzle ever.
Keywords logic puzzle  Boolos
Categories (categorize this paper)
DOI 10.1093/analys/anp140
 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: 16,667
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

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

201 ( #8,862 of 1,726,249 )

Recent downloads (6 months)

16 ( #46,799 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

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