Simplicial belief

DOI10.1016/J.TCS.2026.116047MaRDI QIDQ7263469zbMATH OpenFDO

Authors Christian Cachin, David Lehnherr, Thomas Studer

Publication date 12 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116047

zbMATH Keywords

belief modalityepistemic logicplausibility modelsimplicial complexsomebody-knows modality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• A Simplicial Model for KB4_n: Epistemic Logic with Agents that May Die
• Byzantine quorum systems
• Impure Simplicial Complexes: Complete Axiomatization
• Introduction to Reliable and Secure Distributed Programming
• Naming and Identity in Epistemic Logics Part I: The Propositional Case
• Neighborhood semantics for modal logic
• POLYHEDRAL COMPLETENESS OF INTERMEDIATE LOGICS: THE NERVE CRITERION
• Revisiting epistemic logic with names
• Semi-simplicial set models for distributed knowledge
• Simplicial models for the epistemic logic of faulty agents
• Survey article: an elementary illustrated introduction to simplicial sets
• Synergistic knowledge
• Tarski's theorem on intuitionistic logic, for polyhedra

This page was built for publication: Simplicial belief

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263469)