On formalization of logic puzzles textit{`{a}} ${la}$ Smullyan (Logic, Language, Algebraic system and Related Areas in Computer Science)
-
- 藤田, 憲悦
- 群馬大学
この論文をさがす
抄録
George 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 if-and-only-if. Later, Roberts (2001) and Rabern-Rabern (2008) provided another solution in the style of embedded questions as a simpler solution. Here, 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 two solutions in the different forms are logically equivalent under the semantics. Moreover, 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.
収録刊行物
-
- 数理解析研究所講究録
-
数理解析研究所講究録 2193 18-24, 2021-07
京都大学数理解析研究所
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050852870531500416
-
- NII書誌ID
- AN00061013
-
- HANDLE
- 2433/265699
-
- ISSN
- 18802818
-
- 本文言語コード
- en
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB