On formalization of logic puzzles textit{`{a}} ${la}$ Smullyan (Logic, Language, Algebraic system and Related Areas in Computer Science)

IR (HANDLE) Open Access

Search this article

Description

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.

Journal

  • RIMS Kokyuroku

    RIMS Kokyuroku 2193 18-24, 2021-07

    京都大学数理解析研究所

Related Projects

See more

Details 詳細情報について

  • CRID
    1050852870531500416
  • NII Book ID
    AN00061013
  • HANDLE
    2433/265699
  • ISSN
    18802818
  • Text Lang
    en
  • Article Type
    departmental bulletin paper
  • Data Source
    • IRDB

Report a problem

Back to top