A framework for riddles about truth that do not involve self-reference
This paper presents a framework within which solutions to logic puzzles of the knight/knave kind (where respondents always tell the truth / always lie / answer at random) can be derived. An analogue of \(T\)-sentences is permitted, but the language is sufficiently weak (in not containing self-referential sentences) to remain consistent [\textit{A. Gupta}, ``Truth and paradox, J. Philos. Logic 11, 1--60 (1982; Zbl 0512.03002)]. Three-question or fewer solutions are provided to the ``hardest logic puzzle ever, a puzzle due to Smullyan via Boolos, where the respondent answers ``da or ``ja (one of which means ``Yes, and the other ``No) and may be a truth-teller, a liar, or answer at random.
- A simple solution to the hardest logic puzzle ever
- How to solve the hardest logic puzzle ever in two questions
- scientific article; zbMATH DE number 3672245 (Why is no real title available?)
- On languages that contain their own ungroundedness predicate
- Some thoughts about the hardest logic puzzle ever
- Truth and paradox
- Knights, knaves, normals, and neutrals
- A simple solution to the hardest logic puzzle ever
- Why the hardest logic puzzle ever cannot be solved in less than three questions
- Smullyan's Vizier Problem
- How to solve the hardest logic puzzle ever in two questions
- Some thoughts about the hardest logic puzzle ever
This page was built for publication: A framework for riddles about truth that do not involve self-reference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763326)
