Quantifying Notes

  title={Quantifying Notes},
  author={Hans van Ditmarsch},
We review several logics with propositional quantification. 

To Be Announced

This survey reviews dynamic epistemic logics with modalities for quantification over information change with complete axiomatizations, focussing on axioms involving the interaction between knowledge and such quantifiers, and reports on their relative expressivity and applications.

Quantifying Notes Revisited

This survey presents typical axioms involving the relation between knowledge or belief and informative action, their relative expressivity, directions for applications, and what is known on the decidability and complexity of model checking and satisfiability of dynamic epistemic logics.

The Undecidability of Quantified Announcements

It is shown that when there are multiple agents in the language, the satisfiability problem is undecidable for APAL, GAL, and CAL, and in the single agent case, the satisfaction problem is decidable for all three logics.

Coalition and Group Announcement Logic

This paper considers a combination of these logics – Coalition and Group Announcement Logic and provides its complete axiomatisation and partially answer the question of how group and coalition announcement operators interact, and settle some other open problems.

Refinement modal logic

Arbitrary Public Announcement Logic with Memory

This work introduces Arbitrary Public Announcement Logic with Memory, and presents a complete recursive axiomatization, that includes a natural finitary rule, and examines this logic’s expressivity and the appropriate notion of bisimulation.

Groups Versus Coalitions: On the Relative Expressivity of GAL and CAL

It is shown that there is a propertyexpressible in GAL that is not expressible in CAL, and it is still an open question whether CAL is subsumed by GAL, or whether the two logics have incomparable expressive power.



Bisimulations, model descriptions and propositional quantifiers

In this paper we give perspicuous proofs of the existence of model descriptions for finite Kripke models and of Uniform Interpolation for the theories IPC, K, GL and S4Grz, using bounded

Bisimulation quantifiers for modal logics

Pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus.

Future Event Logic - Axioms and Complexity

This paper presents a sound and complete axiomatization of future event logic, a logic that generalizes a number of dynamic epistemic logics, by using a new operator that acts as a quantifier over the set of all refinements of a given model.

The Modal Logic of Inequality

This work considers some modal languages with a modal operator D whose semantics is based on the relation of inequality, and some connections with a number of other recent proposals to extend the standard modal language.

Axiomatising the Logic of Computer Programming

  • R. Goldblatt
  • Computer Science
    Lecture Notes in Computer Science
  • 1982
This paper presents a meta-modelling framework that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually cataloging and annotating individual commands.

Logics of public communications

Extensions of the logic S5 which can deal with public communications are defined and some completeness, decidability and interpretability results are proved and a general method is formulated that solves certain kind of problems involving public communications.

Characterizing Kripke Structures in Temporal Logic

It is shown that if two finite Kripke structures can be distinguished by some formula that contains both branching-time and linear-time operators, then the structures can been distinguished by a formula that containing only branching time operators.

Refinement modal logic

Characterizing Updates in Dynamic Epistemic Logic

This work axiomatize in this framework what the authors can infer about what is true about (3) given (1) and (2), introducing thereby new techniques to prove completeness and showing that this axiom atization is decidable.

Refinement Quantified Logics of Knowledge