Revisiting Epistemic Logic with Names
@inproceedings{Bilkova2021RevisitingEL,
title={Revisiting Epistemic Logic with Names},
author={Marta B'ilkov'a and Zo{\'e} Christoff and Olivier Roy},
booktitle={Theoretical Aspects of Rationality and Knowledge},
year={2021}
}This paper revisits the multi-agent epistemic logic presented in [10], where agents and sets of agents are replaced by abstract, intensional “names”. We make three contributions. First, we study its model theory, providing adequate notions of bisimulation and frame morphisms, and use them to study the logic’s expressive power and definability. Second, we show that the logic has a natural neighborhood semantics, which in turn allows to show that the axiomatization in [10] does not rely on…
One Citation
Common Knowledge of Abstract Groups
- PhilosophyArXiv
- 2022
Epistemic logics typically talk about knowledge of individ- ual agents or groups of explicitly listed agents. Often, however, one wishes to express knowledge of groups of agents specified by a given…
References
SHOWING 1-10 OF 41 REFERENCES
Naming and Identity in Epistemic Logic Part II: A First-Order Logic for Naming
- Philosophy, Computer ScienceArtif. Intell.
- 1995
Naming and Identity in Epistemic Logics Part I: The Propositional Case
- PhilosophyJ. Log. Comput.
- 1993
The principles involved inModal epistemic logics for many agents often assume a xed one-to-one correspondence between agents and the names for agents that occur in the language, but this assumption restricts the applicability of any logic.
Propositional Epistemic Logics with Quantification Over Agents of Knowledge
- PhilosophyStud Logica
- 2018
It is proved that the satisfiability problem for these logics of PEL(QK) is Pspace-complete using their counterparts in Grove and Halpern (J Log Comput 3(4):345–378, 1993).
Simpler completeness proofs for modal logics with intersection
- PhilosophyDaLí
- 2020
This paper proposes a simpler proof technique by building a treelike canonical model directly, which avoids the complications in the processes of unraveling and folding, and demonstrates the technique by showing completeness of the normal modal logics K, D, T, B, S4 and S5 extended with intersection modalities.
Propositional modal logic with implicit modal quantification
- PhilosophyICLA
- 2019
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them, and a variable-free propositional bi-modal logic with implicit quantification is considered.
EVERYONE KNOWS THAT SOMEONE KNOWS: QUANTIFIERS OVER EPISTEMIC AGENTS
- PhilosophyThe Review of Symbolic Logic
- 2019
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.
Dynamic epistemic logic
- Philosophy, Computer Science
- 1998
A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.
When Names Are Not Commonly Known: Epistemic Logic with Assignments
- PhilosophyAdvances in Modal Logic
- 2018
This work introduces a lightweight modal predicate logic where names can be non-rigid and the language can handle various de dicto and de re distinctions in a natural way.