A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

DOI10.1016/J.JLAMP.2021.100662zbMATH Open1502.68195OpenAlexW3128303183MaRDI QIDQ2043796FDOQ2043796

Authors: Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum, Hans van Ditmarsch, Éric Goubault 

Publication date: 3 August 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100662

Recommendations

• A dynamic epistemic logic analysis of the equality negation task
• On the computational complexity of model checking for dynamic epistemic logic with S5 models
• Tableau method and NEXPTIME-completeness of DEL-sequents
• Symbolic Model Checking for Dynamic Epistemic Logic
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• Merging frameworks for interaction
• A poor man's epistemic logic based on propositional assignment and higher-order observation
• A general framework for dynamic epistemic logic: towards canonical correspondences

zbMATH Keywords

distributed computingcombinatorial topologydynamic epistemic logiccovering spacesequality negation

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Covering spaces and low-dimensional topology (57M10)

Cites Work

• Title not available (Why is that?)
• Logics of communication and change
• Title not available (Why is that?)
• Dynamic Epistemic Logic and Knowledge Puzzles
• Impossibility of distributed consensus with one faulty process
• The topological structure of asynchronous computability
• Title not available (Why is that?)
• A combinatorial characterization of the distributed 1-solvable tasks
• Three-Processor Tasks Are Undecidable
• Title not available (Why is that?)
• Action emulation
• Semantic results for ontic and epistemic change
• A dynamic epistemic logic analysis of the equality negation task
• Covering complexes with applications to algebra
• Locality and checkability in wait-free computing
• The expressivity of update logics
• On the robustness of Herlihy's hierarchy
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Arrow update synthesis
• Wait-free solvability of equality negation tasks

Cited In (9)

• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• Wait-free solvability of equality negation tasks
• Communication pattern logic: epistemic and topological views
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• Impure Simplicial Complexes: Complete Axiomatization
• Simplicial models for the epistemic logic of faulty agents
• A dynamic epistemic logic analysis of the equality negation task
• Defining logical obstruction with fixpoints in epistemic logic
• A Spatial Logic for Simplicial Models

This page was built for publication: A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

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