Impure Simplicial Complex and Term-Modal Logic with Assignment Operators
By: Yuanzhe Yang
Potential Business Impact:
Lets computers understand what people know, even if they die.
Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many conceptually dubious expressions involving dead agents can be expressed in this language. In this paper, we introduce a term-modal language with assignment operators, in which such conceptually dubious expressions are syntactically excluded. We define both simplicial semantics and first-order Kripke semantics for this language, characterize their respective expressivity through notions of bisimulation, and show that the two semantics are equivalent when we consider a special class of first order Kripke models called local epistemic models. We also offer a complete axiomatization for the epistemic logic based on this language, and show that our language has a notion of assignment normal form. Finally, we discuss the behavior of a kind of intensional distributed knowledge that can be naturally expressed in our language.
Similar Papers
Belief in Simplicial Complexes
Logic in Computer Science
Makes computers understand what people believe.
Paraconsistent Constructive Modal Logic
Logic in Computer Science
Helps computers think about things that are both true and false.
Complexity of Łukasiewicz Modal Probabilistic Logics
Logic in Computer Science
Helps computers reason about uncertain ideas.