6 citations · 9 across the 3 of their papers we have counts for
5 papers
A circular proof system for the hybrid mu-calculus
Sebastian Enqvist
We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circula…
Completeness for Game Logic
Sebastian Enqvist, Helle Hvid Hansen, Clemens Kupke +2
Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-…
Flat modal fixpoint logics with the converse modality
Sebastian Enqvist
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Ve…
A New Game Equivalence and its Modal Logic
Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist
We revisit the crucial issue of natural game equivalences, and semantics of game logics based on these. We present reasons for investigating finer concepts of game equivalence than…
Expressiveness of the modal mu-calculus on monotone neighborhood structures
Sebastian Enqvist, Fatemeh Seifan, Yde Venema
We characterize the expressive power of the modal mu-calculus on monotone neighborhood structures, in the style of the Janin-Walukiewicz theorem for the standard modal mu-calculus.…