S5 solution to the red hat puzzle

Disputatio 2 (22):131-137 (2007)
  Copy   BIBTEX

Abstract

I argue that the solution to the Red Hat Problem, a puzzle derived from interactive epistemic logic, requires S5. Interactive epistemic logic is set out in formal terms, and an attempt to solve the red hat puzzle is made in K τσ, K ρτ, and K ρσ, each of which fails, showing that a stronger system, K τσρ is required.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,394

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2024-09-02

Downloads
3 (#1,851,533)

6 months
3 (#1,471,783)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Robert Robinson
University of West Florida

Citations of this work

No citations found.

Add more citations

References found in this work

Convention: A Philosophical Study.David Lewis - 1969 - Synthese 26 (1):153-157.
A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.
What one may come to know.J. van Benthem - 2004 - Analysis 64 (2):95-105.
What one may come to know.van Benthem Johan - 2004 - Analysis 64 (2):95–105.

View all 6 references / Add more references