Skip to main content
Log in

Crazy Truth-Teller–Liar Puzzles

  • Original Paper
  • Published:
Axiomathes Aims and scope Submit manuscript

Abstract

In this manuscript, we define and discuss a new type of logical puzzles. These puzzles are based on the simplest truth-teller and liar puzzles. Graphs are used to represent graphically the puzzles. (The solution of) these logical puzzles contain three types of people. Strong Truth-tellers who can say only true statements, Strong Liars who can make only false statements and Weak Crazy people who must make at least one self-contradicting statement if he/she says anything. Self-contradicting statements are related to the Liar paradox, such that, there is no Truth-teller or a Liar could say “I am a Liar”. In any good puzzle there is a unique solution, while the puzzle is clear if only the people of the puzzle and their statements are given to solve the puzzle. It is well-known that there is no good and clear SS-puzzle (Strong Truth-teller-Strong Liar puzzle). However, in this paper, we show that there are clear and good SSW-puzzles. Characteristics of the newly investigated type of people, the ‘Weak Crazy’ people, has also been studied. Some statistical results about the new type of puzzles and a comparison with other types of puzzles are also shown: the number of solvable and also the number of good puzzles is much larger than in the previously known SS-puzzles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Alzboon L, Nagy B (2020) Truth-teller-Liar Puzzles with Self-reference. Mathematics 8:190

    Article  Google Scholar 

  • Aszalós L (2000) The logic of knights, knaves, normals and mutes. Acta Cybernet 14:533–540

    Google Scholar 

  • Barwise J, Moss LS (1996) Vicious circles: on the mathematics of non-wellfounded phenomena. CSLI Publications, Stanford

    Google Scholar 

  • Bíró CS, Kusper G (2018) Equivalence of strongly connected graphs and black-and-white 2-SAT problems. Miskolc Math Notes 19(2):755–768

    Article  Google Scholar 

  • Chesani F, Mello P, Milano M (2017) Solving mathematical puzzles: a challenging competition for AI. AI Mag 38(3):83

    Google Scholar 

  • Cook RT (2006) Knights, knaves and unknowable truths. Analysis 66(289):10–16

    Article  Google Scholar 

  • Costa JF, Poças D (2018) Solving Smullyan puzzles with formal systems. Axiomathes 28:181–199

    Google Scholar 

  • Holliday RL (2005) Liars and truthtellers: learning logic from Raymond Smullyan. Math Horizons 13(1):5–29

    Article  Google Scholar 

  • Howse J, Stapleton G, Burton J, Blake A (2018) Picturing problems: solving logic puzzles diagrammatically. In SetVR@ Diagrams 12–27

  • Kolany A (1996) A general method of solving Smullyan’s puzzles. Log Log Philos 4(4):97–103

    Google Scholar 

  • Lukowski P (2011) Paradoxes. Springer, Dordrecht

    Book  Google Scholar 

  • Nagy B (2003a) Boolean programming, truth-teller-liar puzzles and related graphs. Proceedings of 25th IEEE Int. Conf. on Information Technology Interfaces, Cavtat, Croatia, 663–668

  • Nagy B (2003b) SW puzzles and their graphs. Acta Cybernet 16:67–82

    Google Scholar 

  • Nagy B (2003c) Truth-teller and liar puzzles and their graphs. Cent Eur J Oper Res 11:57–72

    Google Scholar 

  • Nagy B (2005) Duality of logical puzzles of type SW and WS—their solution using graphs. Pure Math Appl 15(2005):235–252

    Google Scholar 

  • Nagy B (2006) SS-típusú igazmondó-hazug fejtörők gráfelméleti megközelítésben (SS-type truthteller-liar puzzles and their graphs, in Hungarian with English summary). Alkalmazott Matematikai Lapok 23:59–72

    Google Scholar 

  • Nagy B (2019) Optimal Boolean Programming with Graphs. Acta Polytechnica Hungarica 16(4):231–248

    Google Scholar 

  • Nagy B, Allwein G (2004) Diagrams and Non-monotonicity in Puzzles. Int. Conf. on Theory and Application of Diagram. LNCS-LNAI, 2980, Springer, Berlin, Heidelberg, 82–96

  • Nagy B, Kósa M (2001) Logical puzzles (Truth-tellers and liars). 5th Int. Conf. on Applied. Informatics, Eger, Hungary, 105–112

  • Rosenhouse J (2014) Knights, knaves, normals, and neutrals. College Math J 45(4):297–306

    Article  Google Scholar 

  • Russel SJ, Norvig P (1995) Artificial intelligence: a modern approach. Prentice Hall, New Jersey

    Google Scholar 

  • Shasha DE (1998) The puzzling adventures of Dr. Ecco. W.H. Freeman, New York

  • Smullyan R (1978) What is the name of this book? The riddle of dracula and other logical puzzles. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  • Smullyan R (1982) the lady or the tiger?. Knopf, New York

    Google Scholar 

  • Smullyan R (1987) Forever undecided (A puzzle guide to Gödel). Alfred A. Knopf, New York

    Google Scholar 

  • Wos L, Overbeek R, Lusk E, Boyle J (1992) Automated reasoning: introduction and applications. McGraw-Hill, New York

    Google Scholar 

  • Yablo S (2017) Knights, knaves, truth, truthfulness, grounding, tethering, aboutness, and paradox. in raymond smullyan on self reference. Outstanding Contributions to Logic 123–139

Download references

Acknowledgements

Comments of the anonymous reviewer are gratefully acknowledged.

Funding

This research received no external funding.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Benedek Nagy.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alzboon, L., Nagy, B. Crazy Truth-Teller–Liar Puzzles. Axiomathes 32, 639–657 (2022). https://doi.org/10.1007/s10516-021-09546-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10516-021-09546-7

Keywords

Navigation