• Corpus ID: 10057353

Future Event Logic - Axioms and Complexity

@inproceedings{Ditmarsch2010FutureEL,
  title={Future Event Logic - Axioms and Complexity},
  author={Hans van Ditmarsch and Tim French and Sophie Pinchinat},
  booktitle={Advances in Modal Logic},
  year={2010}
}
In this paper we present a sound and complete axiomatization of future event logic. Future event logic is 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. (A refinement is like a bisimulation except that from the three relational requirements only ‘atoms’ and ‘back’ need to be satisfied.) Thus the logic combines the simplicity of modal logic with some powers of monadic second… 

Figures from this paper

Refinement modal logic

Refinement Quantified Logics of Knowledge

Closing a Gap in the Complexity of Refinement Modal Logic

A tight characterization of the complexity of RML satisfiability for any fixed number of alternations of refinement quantifiers is obtained, and it is established that the model checking problem for RML is PSPACE-complete, even for formulas with a single quantifier.

Covariant-Contravariant Refinement Modal μ-calculus

The language of CCRML µ may be considered as a specification language for describing the properties of a system referring to reactive and generative actions and may be used to formalize some interesting problems in the field of formal methods.

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.

Arbitrary Action Model Logic and Action Model Synthesis

  • James Hales
  • Computer Science
    2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2013
This work introduces an extension of the action model logic of Baltag, Moss and Solecki with an action model quantifier, ∃φ which stands for “there is anaction model that results in the post-condition φ”, and shows that this quantifier is equivalent to the refinement quantifier of van Ditmarsch and French.

Refinement Quantifiers for Logics of Belief and Knowledge

Modal logics are extensions of propositional logic, with which one can qualify the truth of statements with operators known as modalities. Epistemic logic is a variant of modal logic, commonly known

Refinement Quantified Logics of Knowledge and Belief for Multiple Agentsc

A sound and complete axiomatisation for the refinement modal logic over the class of unrestricted Kripke models, for a single agent and a provably correct translations to their underlying modal logics, corollaries of which are expressivity and decidability results.

A Composable Language for Action Models

This paper introduces a language that represents action models using syntactic operators inspired by relational actions, and shows in several settings that it is sufficient to represent any action model up to a given modal depth and to represent the results of action model synthesis.

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.

References

SHOWING 1-10 OF 40 REFERENCES

On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of the propositional Μ-calculus, which implies that every logic over transition systems invariant under bisimulation and translatable into MSOL can be also translated into the Μ -calculus.

Proof systems for the coalgebraic cover modality

This work investigates an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken as primitive and presents a sound and complete Hilbert-styl e axiomatiza- tion for each logic.

Completeness of Kozen's Axiomatisat ion of the Propositional p-Calculus

We consider the propositional p-calculus as introduced by Kozen (21. In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is

Dynamic epistemic logic

A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.

Dynamic logic

This book provides the first comprehensive introduction to Dynamic Logic, a system of remarkable unity that is theoretically rich as well as of practical value.

A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames

It is shown that the answers to three basic questions regarding the extension of modal logic with a special kind of propositional quantifiers over arbitrary classes of frames, known as bisimulation quantifiers, do not generalize to arbitrary classes, but they do generalize if the authors restrict to classes of (finite) transitive or transitive and reflexive frames.

Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski

A classical logician's view of the μ-calculus is taken: a new logic should not be allowed into the community of logics without at least considering the standard questions that any logic is bothered with.

Alternating-time temporal logic

This work introduces a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.

Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus

  • I. Walukiewicz
  • Mathematics
    Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
  • 1995
It is shown that the propositional /spl mu/-calculus as introduced by D. Kozen (1983) is complete and its completeness stated as an open problem.