10 research outputs found
Quantifying over Boolean announcements
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 Box
phi intuitively expressing that "after every public announcement of a formula,
formula phi 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, such that Box phi intuitively expresses
that "after every public announcement of a Boolean formula, formula phi is
true". This logic can therefore called Boolean arbitrary public announcement
logic, BAPAL. The logic BAPAL is the subject of this work. Unlike APAL it has a
finitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A
further claim that BAPAL is decidable is deferred to a companion paper
No Finite Model Property for Logics of Quantified Announcements
Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announcement that achieves some certain epistemic goal. Depending on the type of the quantification, we get differ- ent formalisms, the most known of which are arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). It has been an open question whether the logics have the finite model property, and in the paper we answer the question negatively. We also discuss how this result is connected to other open questions in the field.publishedVersio
To Be Announced
In this survey we review dynamic epistemic logics with modalities for
quantification over information change. Of such logics we present complete
axiomatizations, focussing on axioms involving the interaction between
knowledge and such quantifiers, we report on their relative expressivity, on
decidability and on the complexity of model checking and satisfiability, and on
applications. We focus on open problems and new directions for research
Quantifying over information change with common knowledge
Public announcement logic (PAL) extends multi-agent epistemic logic with dynamic operators modelling the effects of public communication. Allowing quantification over public announcements lets us reason about the existence of an announcement that reaches a certain epistemic goal. Two notable examples of logics of quantified announcements are arbitrary public announcement logic (APAL) and group announcement logic (GAL). While the notion of common knowledge plays an important role in PAL, and in particular in characterisations of epistemic states that an agent or a group of agents might make come about by performing public announcements, extensions of APAL and GAL with common knowledge still haven’t been studied in detail. That is what we do in this paper. In particular, we consider both conservative extensions, where the semantics of the quantifiers is not changed, as well as extensions where the scope of quantification also includes common knowledge formulas. We compare the expressivity of these extensions relative to each other and other connected logics, and provide sound and complete axiomatisations. Finally, we show how the completeness results can be used for other logics with quantification over information change.publishedVersio
The Expressivity of Quantified Group Announcements
Group announcement logic (GAL) and coalition announcement logic (CAL) allow us to reason about whether it is possible for groups and coalitions of agents to achieve their desired epistemic goals through truthful public communication. The difference between groups and coalitions in such a context is that the latter make their announcements in the presence of possible adversarial counter-announcements. As epistemic goals may involve some agents remaining ignorant, counter-announcements may preclude coalitions from reaching their goals. We study the relative expressivity of GAL and CAL and provide some results involving their more well-known sibling APAL. We also discuss how the presence of memory alters the relationship between groups and coalition
Quantifying over Boolean announcements
International audienceVarious 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 Box phi intuitively expressing that "after every public announcement of a formula, formula phi 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, such that Box phi intuitively expresses that "after every public announcement of a Boolean formula, formula phi is true". This logic can therefore called Boolean arbitrary public announcement logic, BAPAL. The logic BAPAL is the subject of this work. Unlike APAL it has a finitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A further claim that BAPAL is decidable is deferred to a companion paper