When Names Are Not Commonly Known: Epistemic Logic with Assignments
Artificial Intelligence
2018-06-26 v2 Logic in Computer Science
Logic
Abstract
In standard epistemic logic, agent names are usually assumed to be common knowledge implicitly. This is unreasonable for various applications. Inspired by term modal logic and assignment operators in dynamic logic, we introduce a lightweight modal predicate logic where names can be non-rigid. The language can handle various de dicto and de re distinctions in a natural way. The main technical result is a complete axiomatisation of this logic over S5 models.
Keywords
Cite
@article{arxiv.1805.03852,
title = {When Names Are Not Commonly Known: Epistemic Logic with Assignments},
author = {Yanjing Wang and Jeremy Seligman},
journal= {arXiv preprint arXiv:1805.03852},
year = {2018}
}
Comments
18 pages, to appear in proceedings of AiML2018