Communication pattern logic: epistemic and topological views
From MaRDI portal
Publication:6054065
DOI10.1007/s10992-023-09713-8arXiv2207.00823MaRDI QIDQ6054065
Armando Castañeda, Hans P. van Ditmarsch, Diego A. Velázquez, David A. Rosenblueth
Publication date: 24 October 2023
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.00823
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Action emulation
- On axiomatizations of public announcement logic
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity
- Relativized common knowledge for dynamic epistemic logic
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Dynamic epistemic logic
- Group announcement logic
- Merging frameworks for interaction
- Cheating husbands and other stories: A case study of knowledge, action, and communication
- Reasoning about information change
- Resolving distributed knowledge
- 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
- Arrow update synthesis
- The Heard-Of model: computing in distributed systems with benign faults
- Free logic and the concept of existence
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions
- Oblivious Collaboration
- ARROW UPDATE LOGIC
- Knowledge and common knowledge in a distributed environment
- Dynamic logic of preference upgrade
- Distributed knowledge
- A survey of gossiping and broadcasting in communication networks
- The Byzantine Generals Problem
- Asynchronous Announcements
- Topological Characterization of Consensus under General Message Adversaries
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
This page was built for publication: Communication pattern logic: epistemic and topological views
