Public announcement logic with distributed knowledge: expressivity, completeness and complexity

DOI10.1007/s11229-012-0243-3zbMath1310.03030OpenAlexW2088585623MaRDI QIDQ484926

Yong-Cai Geng, Sumit K. Garg

Publication date: 8 January 2015

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-012-0243-3

zbMATH Keywords

computational complexitycompletenessdecidabilityexpressivityfoldingpublic announcement logicdistributed knowledgetrans-bisimulationunravelling

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Related Items (10)

О трудностях определения имплицитного знания группы ⋮ Logics with group announcements and distributed knowledge: completeness and expressive power ⋮ Resolving distributed knowledge ⋮ Group Belief ⋮ To be announced ⋮ Communication pattern logic: epistemic and topological views ⋮ Relativized common knowledge for dynamic epistemic logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coalition and relativised group announcement logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guide to completeness and complexity for modal logics of knowledge and belief
• Propositional dynamic logic of regular programs
• Logics for epistemic programs
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• Public Announcement Logic with Distributed Knowledge
• Dynamic Epistemic Logic and Knowledge Puzzles
• Distributed knowledge
• MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• What can machines know?
• Computer Science Logic
• PDL with Intersection and Converse Is 2EXP-Complete

This page was built for publication: Public announcement logic with distributed knowledge: expressivity, completeness and complexity