Everyone Knows That Someone Knows: Quantifiers Over Epistemic Agents

Review of Symbolic Logic 12 (2):255-270 (2019)
  Copy   BIBTEX

Abstract

Modal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging over the set of agents, and proves its soundness and completeness with respect to a Kripke semantics.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2019-01-10

Downloads
33 (#674,122)

6 months
5 (#1,013,271)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Pavel Naumov
University of Southampton

References found in this work

A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.
Symbolic Logic.C. I. Lewis & C. H. Langford - 1932 - Erkenntnis 4 (1):65-66.
Propositional quantifiers in modal logic.Kit Fine - 1970 - Theoria 36 (3):336-346.
The logic of justification.Sergei Artemov - 2008 - Review of Symbolic Logic 1 (4):477-513.

View all 11 references / Add more references