How to solve the hardest logic puzzle ever in two questions
Analysis 70 (1):39-44 (2010)
| Abstract |
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 |
| Options |
Save to my reading list
Follow the author(s)
My bibliography
Export citation
Edit this record
Mark as duplicate
Request removal from index
|
Download optionsOur Archive
Upload a copy of this paper Check publisher's policy Papers currently archived: 28,743
External links
- From the Publisher via CrossRef (no proxy)
- analysis.oxfordjournals.org (no proxy)
- analysis.oxfordjournals.org [2] (no proxy)
- analysis.oxfordjournals.org [3] (no proxy)
- analysis.oxfordjournals.org [4] (no proxy)
- analysis.oxfordjournals.org [5] (no proxy)
- jstor.org (no proxy)
- academic.oup.com
(no proxy)
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
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
A Simple Solution to the Hardest Logic Puzzle Ever.Brian Rabern & Landon Rabern - 2008 - Analysis 68 (2):105-112.
Citations of this work BETA
Reasoning About Agent Types and the Hardest Logic Puzzle Ever.Fenrong Liu & Yanjing Wang - 2013 - Minds and Machines 23 (1):123-161.
Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less Than Three Questions.Gregory Wheeler & Pedro Barahona - 2012 - Journal of Philosophical Logic 41 (2):493-503.
A Framework for Riddles About Truth That Do Not Involve Self-Reference.Stefan Wintein - 2011 - Studia Logica 98 (3):445-482.
Similar books and articlesA Simple Solution to the Hardest Logic Puzzle Ever.Brian Rabern & Landon Rabern - 2008 - Analysis 68 (2):105-112.
Some Thoughts About the Hardest Logic Puzzle Ever.Tim S. Roberts - 2001 - Journal of Philosophical Logic 30 (6):609-612.
A Pragmatic Solution to Ostertag's Puzzle.Philip Atkins - 2013 - Philosophical Studies 163 (2):359-365.
A Note on the Relationship Between Mates' Puzzle and Frege's Puzzle.M. A. Moffett - 2002 - Journal of Semantics 19 (2):159-166.
Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less Than Three Questions.Gregory Wheeler & Pedro Barahona - 2012 - Journal of Philosophical Logic 41 (2):493-503.
Monthly downloads
Added to index
2009-12-26Total downloads
251 ( #13,979 of 2,178,087 )Recent downloads (6 months)
7 ( #39,645 of 2,178,087 )How can I increase my downloads?
My notes
Discussion
Nothing in this forum yet.
