Positive announcements

DOI10.1007/s11225-020-09922-1OpenAlexW2796131438MaRDI QIDQ2046881

James Hales, Tim French, Hans P. van Ditmarsch

Publication date: 19 August 2021

Published in: Studia Logica (Search for Journal in Brave)

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

zbMATH Keywords

multi-agent systemsdynamic epistemic logicuniversal formulas

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (5)

Logics with group announcements and distributed knowledge: completeness and expressive power ⋮ To be announced ⋮ Arbitrary public announcement logic with memory ⋮ Unnamed Item ⋮ Verification and strategy synthesis for coalition announcement logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The undecidability of quantified announcements
• A colouring protocol for the generalized Russian cards problem
• Refinement modal logic
• The secret of my success
• Group announcement logic
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Modal languages and bounded fragments of predicate logic
• Reasoning about information change
• The Russian cards problem
• Bounds on secret key exchange using a random deal of cards
• The undecidability of arbitrary arrow update logic
• On the definability of simulation and bisimulation in epistemic logic
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Algebraic laws for nondeterminism and concurrency
• Alternation
• A little knowledge goes a long way
• Putting right the wording and the proof of the Truth Lemma forAPAL
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• Arbitrary Action Model Logic and Action Model Synthesis

This page was built for publication: Positive announcements