Impure Simplicial Complexes: Complete Axiomatization

DOI10.46298/lmcs-19(4:3)2023arXiv2211.13543OpenAlexW4387727632MaRDI QIDQ6076177

Unnamed Author, Roman Kuznets, Hans P. van Ditmarsch

Publication date: 23 October 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.13543

zbMATH Keywords

completenesssimplicial complexesepistemic logiccanonical model

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Dynamic epistemic logic
• Belief as defeasible knowledge
• Resolving distributed knowledge
• On knowledge and communication complexity in distributed systems
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
• Wanted dead or alive: epistemic logic for impure simplicial complexes
• An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• The topological structure of asynchronous computability
• Knowledge and common knowledge in a distributed environment
• A combinatorial characterization of the distributed 1-solvable tasks
• DEFINING KNOWLEDGE IN TERMS OF BELIEF: THE MODAL LOGIC PERSPECTIVE
• Impossibility of distributed consensus with one faulty process
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• A Sound Foundation for the Topological Approach to Task Solvability
• A Simplicial Model for $KB4_n$: Epistemic Logic with Agents that May Die

This page was built for publication: Impure Simplicial Complexes: Complete Axiomatization