ダウンロード数: 61
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
2193-04.pdf | 4.29 MB | Adobe PDF | 見る/開く |
タイトル: | On formalization of logic puzzles textit{`{a}} ${la}$ Smullyan (Logic, Language, Algebraic system and Related Areas in Computer Science) |
著者: | Fujita, Ken-etsu |
著者名の別形: | 藤田, 憲悦 |
発行日: | Jul-2021 |
出版者: | 京都大学数理解析研究所 |
誌名: | 数理解析研究所講究録 |
巻: | 2193 |
開始ページ: | 18 |
終了ページ: | 24 |
抄録: | 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. |
URI: | http://hdl.handle.net/2433/265699 |
出現コレクション: | 2193 論理・言語・代数系と計算機科学の周辺領域 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。