When Names Are Not Commonly Known: Epistemic Logic with Assignments

2018/05/10 by Yanjing Wang, Jeremy Seligman, Wang, Yanjing +1
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.1805.03852

openalex publication_date 2018/05/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Impure Simplicial Complex and Term-Modal Logic with Assignment Operators
• Putting the Agents back in the Domain: A Two-Sorted Term-Modal Logic
• Dynamic Term-Modal Logic for Epistemic Social Network Dynamics (Extended Version)
• Base-extension Semantics for S5 Modal Logic
• Non-Rigid Designators in Modal and Temporal Free Description Logics (Extended Version)