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

Wheeler, Gregory und Barahona, Pedro (2012): Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions. In: Journal of Philosophical Logic, Bd. 41, Nr. 2: S. 493-503

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.

• Dokumententyp: Zeitschriftenartikel
• Keywords: Boolos; Logic puzzle; Information theory
• Fakultät: Philosophie, Wissenschaftstheorie und Religionswissenschaft > Munich Center for Mathematical Philosophy (MCMP) ; Philosophie, Wissenschaftstheorie und Religionswissenschaft > Munich Center for Mathematical Philosophy (MCMP) > Logic
• Themengebiete: 100 Philosophie und Psychologie > 160 Logik
• ISSN: 0022-3611
• Sprache: Englisch