‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’

DOI10.1017/S1755020308080210zbMath1208.03019MaRDI QIDQ3580674

Andreas Herzig, Tomohiro Hoshi, Tiago de Lima, Philippe Balbiani, Alexandru Baltag, Hans P. van Ditmarsch

Publication date: 13 August 2010

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

public announcement logicknowabilityMoore sentencemiltiagent epistemic logicnecessity form

Mathematics Subject Classification ID

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

Related Items (39)

On Composing Finite Forests with Modal Logics ⋮ The undecidability of quantified announcements ⋮ Weighted modal logic in epistemic and deontic contexts ⋮ The Complexity of One-Agent Refinement Modal Logic ⋮ Logics with group announcements and distributed knowledge: completeness and expressive power ⋮ Arbitrary arrow update logic ⋮ The undecidability of arbitrary arrow update logic ⋮ Inquisitive logic as an epistemic logic of knowing how ⋮ Putting right the wording and the proof of the Truth Lemma forAPAL ⋮ Propositional quantification in logics of contingency ⋮ Merging DEL and ETL ⋮ To be announced ⋮ Everything is learnable, once it is settled ⋮ Arbitrary public announcement logic with memory ⋮ Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard ⋮ The many faces of closure and introspection. An ineractive perspective ⋮ Logic for update products and steps into the past ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Arrow update synthesis ⋮ Simulative belief logic ⋮ Refinement modal logic ⋮ Information dynamics and uniform substitution ⋮ Exploring the tractability border in epistemic tasks ⋮ Topological Subset Space Models for Public Announcements ⋮ Knowledge, Time, and Paradox: Introducing Sequential Epistemic Logic ⋮ Coalition and relativised group announcement logic ⋮ Logics of temporal-epistemic actions ⋮ Dynamics we can believe in: a view from the Amsterdam school on the centenary of Evert Willem Beth ⋮ What will they say? -- Public announcement games ⋮ Group announcement logic ⋮ Positive announcements ⋮ The complexity of one-agent refinement modal logic ⋮ Announcement as effort on topological spaces ⋮ An Alternative Logic for Knowability ⋮ Verification and strategy synthesis for coalition announcement logic ⋮ Keep `hoping' for rationality: a solution to the backward induction paradox ⋮ CONTINGENCY AND KNOWING WHETHER

Cites Work

• The secret of my success
• Dynamic epistemic logic
• Axiomatising the logic of computer programming
• Reasoning about information change
• Logics of public communications
• The undecidability of iterated modal relativization
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• Propositional quantifiers in modal logic1
• Victor's error
• A logical analysis of some value concepts
• What one may come to know
• Clues to the paradoxes of knowability: reply to Dummett and Tennant
• A Tableau Method for Public Announcement Logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’