First-Order Game Logic and Modal Mu-Calculus

by   Noah Abou El Wafa, et al.

This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the propositional case, both logics are shown to have the same expressive power and their proof calculi to have the same deductive power. Both calculi are also mutually relatively complete. In the presence of differential equations, corollaries obtain usable and complete translations between differential game logic, a logic for the deductive verification of hybrid games, and the differential mu-calculus, the modal mu-calculus for hybrid systems. The differential mu-calculus is complete with respect to first-order fixpoint logic and differential game logic is complete with respect to its ODE-free fragment.


page 1

page 2

page 3

page 4


Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics

We investigate the expressive power of the two main kinds of program log...

Formula size games for modal logic and μ-calculus

We propose a new version of formula size game for modal logic. The game ...

Complete Additivity and Modal Incompleteness

In this paper, we tell a story about incompleteness in modal logic. The ...

First-Order Modal ξ-Calculus

This paper proposes first-order modal ξ-calculus as well as genealogical...

Complexity through Translations for Modal Logic with Recursion

This paper studies the complexity of classical modal logics and of their...

NP Reasoning in the Monotone μ-Calculus

Satisfiability checking for monotone modal logic is known to be (only) N...

Dialogues for proof search

Dialogue games are a two-player semantics for a variety of logics, inclu...