Semi-Simplicial Set Models for Distributed Knowledge

In recent years, a new class of models for multi-agent epistemic logic has emerged, based on simplicial complexes. Since then, many variants of these simplicial models have been investigated, giving rise to different logics and axiomatizations. In this paper, we present a further generalization, which encompasses all previously studied variants of simplicial models. Geometrically, this is achieved by generalizing beyond simplicial complexes, and considering instead semi-simplicial sets. By doing so, we define a new semantics for epistemic logic with distributed knowledge, where a group of agents may distinguish two worlds, even though each individual agent in the group is unable to distinguish them. As it turns out, these models are the geometric counterpart of a generalization of Kripke models, called "pseudo-models". We show how to recover the previously defined variants of simplicial models as sub-classes of our models; and give a sound and complete axiomatization for each of them.

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

[2]  Susumu Nishimura.  Proving Unsolvability of Set Agreement Task with Epistemic mu-Calculus , 2022, arXiv.org.

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

[4]  Sergio Rajsbaum,et al.  A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks , 2021, J. Log. Algebraic Methods Program..

[5]  Susumu Nishimura,et al.  Logical Obstruction to Set Agreement Tasks for Superset-Closed Adversaries , 2020, ArXiv.

[6]  Sonja Smets,et al.  Learning What Others Know , 2020, LPAR.

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

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

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

[10]  R. Ghrist,et al.  Distributed computation of coverage in sensor networks by homological methods , 2012, Applicable Algebra in Engineering, Communication and Computing.

[11]  Alexandru Baltag,et al.  Correlated Knowledge: an Epistemic-Logic View on Quantum Entanglement , 2010 .

[12]  Greg Friedman,et al.  An elementary illustrated introduction to simplicial sets , 2008, 0809.4221.

[13]  John C. Baez,et al.  Convenient Categories of Smooth Spaces , 2008, 0807.1704.

[14]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

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

[16]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

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

[18]  Ihrer Grenzgebiete,et al.  Ergebnisse der Mathematik und ihrer Grenzgebiete , 1975, Sums of Independent Random Variables.

[19]  Samuel Eilenberg,et al.  SEMI-SIMPLICIAL COMPLEXES AND SINGULAR HOMOLOGY , 1950 .

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

[21]  Sergio Rajsbaum,et al.  Wait-Free Solvability of Equality Negation Tasks , 2019, DISC.

[22]  E. Riehl.  A LEISURELY INTRODUCTION TO SIMPLICIAL SETS , 2011 .

[23]  G. Even,et al.  (Extended Abstract) ABSTRACT , 2022 .

[24]  Henrik Sahlqvist.  Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[25]  Peter Gabriel,et al.  Calculus of Fractions and Homotopy Theory , 1967 .

[26]  J. Gerbrandy,et al.  Distributed Knowledge , 2022 .