Quantifying over boolean announcements

  title={Quantifying over boolean announcements},
  author={Hans van Ditmarsch and Tim French},
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. Now consider restricting the APAL quantification to public announcements of boolean formulas only… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
2 Citations
23 References
Similar Papers


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…