The University of Southampton
×
Filter your search:
University of Southampton Institutional Repository

Everyone Knows that Someone Knows: Quantifiers over Epistemic Agents

Everyone Knows that Someone Knows: Quantifiers over Epistemic Agents
Everyone Knows that Someone Knows: Quantifiers over Epistemic Agents
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.
1755-0203
255-270
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Tao, Jia
008c0748-696c-4069-a351-551d311e8056
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Tao, Jia
008c0748-696c-4069-a351-551d311e8056

Naumov, Pavel and Tao, Jia (2019) Everyone Knows that Someone Knows: Quantifiers over Epistemic Agents. The Review of Symbolic Logic, 12 (2), 255-270. (doi:10.1017/S1755020318000497).

Record type: Article

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.

Text
2017-rsl - Accepted Manuscript
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (329kB)

More information

e-pub ahead of print date: 9 January 2019
Learn more about Agents, Interactions and Complexity research

Identifiers

Local EPrints ID: 479201
URI: http://eprints.soton.ac.uk/id/eprint/479201
DOI: doi:10.1017/S1755020318000497
ISSN: 1755-0203
PURE UUID: 1c922fc7-83bd-4e62-ae8e-b9aaef794c54
ORCID for Pavel Naumov: ORCID iD orcid.org/0000-0003-1687-045X

Catalogue record

Date deposited: 20 Jul 2023 16:44
Last modified: 17 Mar 2024 04:10

Export record

Altmetrics

Contributors

Author: Pavel Naumov ORCID iD
Author: Jia Tao

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information
Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×