A framework for riddles about truth that do not involve self-reference

DOI10.1007/S11225-011-9343-1MaRDI QIDQ763326zbMATH OpenOpenAlexFDO

Authors Stefan Wintein

Publication date 9 March 2012

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-011-9343-1

zbMATH Keywords

hardest logic puzzle everself-referenceSmullyan's logic puzzles

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05)

Recommendations

• Why the hardest logic puzzle ever cannot be solved in less than three questions
• A simple solution to the hardest logic puzzle ever
• The logic of knights, knaves, normals and mutes
• How to solve the hardest logic puzzle ever in two questions
• Smullyan's Vizier Problem

Cites work

• 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

Cited in

(6)

• 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)