Abstract
In Smullyan’s well known logic puzzles (see for instance [3]), the notion of a knight, which is a creature that always speaks the truth, plays an important role. Rabern and Rabern (in [2]) made the following observation with respect to knights. They noted that when a knight is asked (1), he gets into serious trouble.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kripke, S.: Outline of a theory of truth. Journal of Philosophical Logic 72, 690–716 (1975)
Rabern, B., Rabern, L.: A simple solution to the hardest logic puzzle ever. Analysis 68, 105–112 (2008)
Smullyan, R.: The Lady or the Tiger. Pelican Books (1983)
Smullyan, R.: First-order Logic. Dover, New York (1995)
Wintein, S.: Computing with self-reference. In: Proceedings of the A.G.P.C. 09 conference, available online (2009)
Wintein, S.: On languages that contain their own ungroundedness predicate. To appear in: Logique et Analyse, also available in the online proceedings of ESSLLI’ 09 (2009)
Wintein, S.: Assertoric alethic semantics and the six cornerstones of truth (submitted) (2010)
Wintein, S.: Assertoric semantics and the computational power of self-referential truth (submitted) (2010)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wintein, S. (2010). What Makes a Knight?. In: Icard, T., Muskens, R. (eds) Interfaces: Explorations in Logic, Language and Computation. ESSLLI ESSLLI 2008 2009. Lecture Notes in Computer Science(), vol 6211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14729-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-14729-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14728-9
Online ISBN: 978-3-642-14729-6
eBook Packages: Computer ScienceComputer Science (R0)