Coalition and Relativised Group Announcement Logic

There are several ways to quantify over public announcements. The most notable are reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL correspondingly), with the latter being the least studied so far. In the present work, we consider coalition announcements through the lens of group announcements, and provide a complete axiomatisation of a logic with coalition announcements. To achieve this, we employ a generalisation of group announcements. Moreover, we study some logical properties of both coalition and group announcements that have not been studied before.acceptedVersio

Verification and Strategy Synthesis for Coalition Announcement Logic

Coalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.publishedVersio

Coalition and coalition announcement logic

Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other’s knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition Announcement Logic. They allow us to reason about what groups of agents can achieve through joint announcements in non-competitive and competitive environments. In this paper, we consider a combination of these logics – Coalition and Group Announcement Logic and provide its complete axiomatisation. Moreover, we partially answer the question of how group and coalition announcement operators interact, and settle some other open problems

Coalition announcements

Coalition announcement logic is one of the family of logics of quantified announcements. It extends public announcement logic with formulas $\langle \! [ G ] \! \rangle \varphi$ that are read as `there is a truthful public announcement by agents from $G$ such that whatever agents from $A \setminus G$ announce at the same time, $\varphi$ holds after the joint announcement.' The logic has enjoyed comparatively less attention than its siblings --- arbitrary and group announcement logics. The reason for such a situation can be partially attributed to the inherent alternation of quantification in coalition announcements. To deal with the problem, we consider relativised group announcements that separate the coalition's announcement from the anti-coalition's response. We present coalition and relativised group announcement logic and show its completeness. Apart from that, we prove that the complexity of the model-checking problem for coalition announcement logic is PSPACE-complete in the general case, and in P in a special case of positive target formulas. We also study relative expressivity of logics of quantified announcements. In particular we show that arbitrary and coalition announcement logics are not at least as expressive as group announcement logic. Finally, we present a counter-example to the proposed definition of coalition announcements in terms of group announcements, and consider some other interesting properties

The political economy of competitiveness and social mobility

Social mobility has become a mainstream political and media issue in recent years in the United Kingdom. This article suggests that part of the reason for this is that it can serve as a mechanism to discuss policy concerns that appear to be about social justice without questioning important aspects of neo-liberal political economy. The article charts the policy rhetoric on social mobility under both New Labour and the current Coalition Government. It is argued first that under New Labour the apparent commitment to social mobility was in fact subsumed beneath the pursuit of neo-liberal competitiveness, albeit imperfectly realised in policy. Second, the article suggests that under the Coalition Government the commitment to raising levels of social mobility has been retained and the recently published Strategy for Social Mobility promises that social mobility is what the Coalition means when it argues that the austerity programme is balanced with ‘fairness’. Third, however, the Strategy makes clear that the Coalition define social mobility in narrower terms than the previous government. It is argued here that in narrowing the definition the connection with the idea of competitiveness, while still clearly desirable for the Coalition, is weakened. Fourth, a brief analysis of the Coalition's main policy announcements provides little evidence to suggest that even the narrow definition set out in the Strategy is being seriously pursued. Fifth, the international comparative evidence suggests that any strategy aimed at genuinely raising the level of social mobility would need to give much more serious consideration to narrowing levels of inequality. Finally, it is concluded that when considered in the light of the arguments above, the Strategy for Social Mobility – and therefore ‘Fairness’ itself – is merely a discursive legitimation of the wider political economy programme of austerity

Coalition announcements

Coalition announcement logic is one of the family of logics of quantified announcements. It extends public announcement logic with formulas $\langle \! [ G ] \! \rangle \varphi$ that are read as `there is a truthful public announcement by agents from $G$ such that whatever agents from $A \setminus G$ announce at the same time, $\varphi$ holds after the joint announcement.' The logic has enjoyed comparatively less attention than its siblings --- arbitrary and group announcement logics. The reason for such a situation can be partially attributed to the inherent alternation of quantification in coalition announcements. To deal with the problem, we consider relativised group announcements that separate the coalition's announcement from the anti-coalition's response. We present coalition and relativised group announcement logic and show its completeness. Apart from that, we prove that the complexity of the model-checking problem for coalition announcement logic is PSPACE-complete in the general case, and in P in a special case of positive target formulas. We also study relative expressivity of logics of quantified announcements. In particular we show that arbitrary and coalition announcement logics are not at least as expressive as group announcement logic. Finally, we present a counter-example to the proposed definition of coalition announcements in terms of group announcements, and consider some other interesting properties

Maine Lesbian Feminist Newsletter 07/1980

Agenda for July 19 Meeting The Susan B. Anthony Club Lesbian Defense Fund Maine Coalition for Family Crisis Services Gay Rights National Lobby call to action Anti-Discrimination Proposal Passed at Baltimore White House Conference on Families Rural (Lesbian?)-Gay Conference Announcements Publications Advertisements Poetryhttps://digitalcommons.usm.maine.edu/mlfn/1040/thumbnail.jp

Maine Lesbian Feminist Newsletter 07/1980

Agenda for July 19 Meeting The Susan B. Anthony Club Lesbian Defense Fund Maine Coalition for Family Crisis Services Gay Rights National Lobby call to action Anti-Discrimination Proposal Passed at Baltimore White House Conference on Families Rural (Lesbian?)-Gay Conference Announcements Publications Advertisements Poetryhttps://digitalcommons.usm.maine.edu/mlfn/1040/thumbnail.jp