A general form on the logic puzzles of Boolos (Logic, Algebraic system, Language and Related Areas in Computer Science)
この論文をさがす
抄録
Boolos (1996) posed the puzzle "The hardest logic puzzle ever" which had been devised by Raymond Smullyan, and gave a solution in the style of biconditional questions. We introduce a simple formalization of the puzzle consisting of questions, answerers, and answers in terms of propositional logic, and show its adequacy by the truth values (0, 1) semantics. Then it turns out that the hardest logic puzzle can be considered as a natural extension of the puzzles of knights and knaves, i.e., lying and truth-telling by Smullyan. Here, we pose a general form of the puzzle, and provide partial solutions to some of the instances.
収録刊行物
-
- 数理解析研究所講究録
-
数理解析研究所講究録 2229 21-29, 2022-09
京都大学数理解析研究所
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050295491694665472
-
- NII書誌ID
- AN00061013
-
- HANDLE
- 2433/279740
-
- ISSN
- 18802818
-
- 本文言語コード
- en
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB