When Names Are Not Commonly Known: Epistemic Logic with Assignments

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 /de re distinctions in a natural way. The main technical result is a complete axiomatisation of this logic over S5 models.