A Simplicial Model for KB4n: Epistemic Logic with Agents that May Die

The standard semantics of multi-agent epistemic logic S5n is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that has been formalized as pure simplicial models in [13]. Here we extend the theory to encompass all simplicial models — including the ones that are not pure. The corresponding Kripke models are those where the accessibility relation is symmetric and transitive, but might not be reflexive. This yields the epistemic logic KB4n, which can reason about situations where some of the agents may die. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics

[1]  Dmitry N. Kozlov,et al.  Combinatorial Algebraic Topology , 2007, Algorithms and computation in mathematics.

[2]  Pierre Fraigniaud,et al.  Synchronous t-Resilient Consensus in Arbitrary Graphs , 2019, SSS.

[3]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[4]  John C. Mitchell,et al.  Kripke-Style Models for Typed lambda Calculus , 1991, Ann. Pure Appl. Log..

[5]  Jean-Gabriel Young,et al.  Networks beyond pairwise interactions: structure and dynamics , 2020, ArXiv.

[6]  Maurice Herlihy,et al.  A New Synchronous Lower Bound for Set Agreement , 2001, DISC.

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

[8]  Lawrence S. Moss,et al.  Topological Reasoning and the Logic of Knowledge , 1996, Ann. Pure Appl. Log..

[9]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[10]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[11]  Emmanuel Godard,et al.  A characterization of oblivious message adversaries for which Consensus is solvable , 2015, Theor. Comput. Sci..

[12]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

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

[14]  Yoram Moses,et al.  Unbeatable Set Consensus via Topological and Combinatorial Reasoning , 2016, PODC.

[15]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

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

[17]  Hans van Ditmarsch.  Wanted Dead or Alive : Epistemic logic for impure simplicial complexes , 2021, WoLLIC.

[18]  Nancy A. Lynch,et al.  Tight bounds for k-set agreement , 2000, J. ACM.

[19]  A. Tarski,et al.  The Algebra of Topology , 1944 .

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

[21]  Michel Raynal,et al.  Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour , 2017, NETYS.

[22]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[23]  Joseph Y. Halpern,et al.  A Knowledge-Based Analysis of the Blockchain Protocol , 2017, TARK.

[24]  Vijay K. Garg,et al.  Byzantine Lattice Agreement in Synchronous Message Passing Systems , 2020, DISC.

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

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

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

[28]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[29]  Wiebe van der Hoek,et al.  Epistemic Logic : Language and Axiom Systems , 2014 .

[30]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[31]  Frans Voorbraak,et al.  Generalized Kripke Models for Epistemic Logic , 1991, TARK.

[32]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[33]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[34]  Michael Okun,et al.  Strong order-preserving renaming in the synchronous message passing model , 2010, Theor. Comput. Sci..

[35]  Ismar Volic,et al.  Political structures and the topology of simplicial complexes , 2021, Math. Soc. Sci..

[36]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[37]  Adam Bjorndahl,et al.  Logic and Topology for Knowledge, Knowability, and Belief - Extended Abstract , 2016, TARK.

[38]  Yoram Moses.  Knowledge in Distributed Systems , 2016, Encyclopedia of Algorithms.

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

[40]  Lawrence S. Moss,et al.  Topology and Epistemic Logic , 2007, Handbook of Spatial Logics.