A many-sorted epistemic logic for chromatic hypergraphs

We propose a many-sorted modal logic for reasoning about knowledge in multi-agent systems. Our logic introduces a clear distinction between participating agents and the environment. This allows to express local properties of agents and global properties of worlds in a uniform way, as well as to talk about the presence or absence of agents in a world. The logic subsumes the standard epistemic logic and is a conservative extension of it. The semantics is given in chromatic hypergraphs, a generalization of chromatic simplicial complexes, which were recently used to model knowledge in distributed systems. We show that the logic is sound and complete with respect to the intended semantics. We also show a further connection of chromatic hypergraphs with neighborhood frames.

[1]  S. Rajsbaum,et al.  Semi-Simplicial Set Models for Distributed Knowledge , 2023, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[2]  Yifeng Ding,et al.  Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic , 2023, Synthese.

[3]  H. V. Ditmarsch,et al.  Impure Simplicial Complexes: Complete Axiomatization , 2022, ArXiv.

[4]  S. Rajsbaum,et al.  A Simplicial Model for KB4n: Epistemic Logic with Agents that May Die , 2021, STACS.

[5]  Sergio Rajsbaum,et al.  Knowledge and simplicial complexes , 2020, ArXiv.

[6]  Sergio Rajsbaum,et al.  A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability , 2018, GandALF.

[7]  Eric Pacuit,et al.  Neighborhood Semantics for Modal Logic , 2017 .

[8]  Kohei Kishida,et al.  Contextuality, Cohomology and Paradox , 2015, CSL.

[9]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[10]  Roy Dyckhoff,et al.  POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION , 2009, The Review of Symbolic Logic.

[11]  Jelle Gerbrandy,et al.  Reasoning about Information Change , 1997, J. Log. Lang. Inf..

[12]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[13]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1990, JACM.

[14]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[15]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[16]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[17]  N. Malcolm On Knowledge and Belief , 1954 .

[18]  H. V. Ditmarsch Wanted Dead or Alive : Epistemic logic for impure simplicial complexes , 2021, WoLLIC.

[19]  Maurice Herlihy,et al.  An Overview of Synchronous Message-Passing and Topology , 2000, GETCO.

[20]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[21]  Maurice Herlihy,et al.  Algebraic Topology and Distributed Computing: A Primer , 1995, Computer Science Today.