PhilSci Archive

Why the hardest logic puzzle ever cannot be solved in less than three questions

Wheeler, Gregory and Barahona, Pedro (2012) Why the hardest logic puzzle ever cannot be solved in less than three questions. [Preprint]

[img]
Preview
PDF
devious.pdf - Accepted Version

Download (159kB)

Abstract

Rabern and Rabern (2008) and Uzquiano (2010) have each presented increasingly harder versions of ‘the hardest logic puzzle ever’ (Boolos 1996), 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.


Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Preprint
Creators:
CreatorsEmailORCID
Wheeler, Gregorygregory.r.wheeler@gmail.com
Barahona, Pedropb@fct.unl.pt
Additional Information: Published in Journal of Philosophical Logic
Subjects: Specific Sciences > Computation/Information
Depositing User: Gregory Wheeler
Date Deposited: 27 Dec 2012 19:36
Last Modified: 27 Dec 2012 19:36
Item ID: 9490
Subjects: Specific Sciences > Computation/Information
Date: 2012
URI: https://philsci-archive-dev.library.pitt.edu/id/eprint/9490

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item