We survey different notions of bisimulation equivalence that provide flexible and powerful
concepts for understanding the expressive power as well as the model-theoretic and …

This paper contributes to the theory of the modal μ-calculus by proving some model-
theoretic results. More in particular, we discuss a number of semantic properties pertaining …

Lindstr\" om theorems characterize logics in terms of model-theoretic conditions such as
Compactness and the L\" owenheim-Skolem property. Most existing characterizations of this …

We generalize two well-known model-theoretic characterization theorems from propositional
modal logic to first-order modal logic (FML, for short). We first study FML-definable frames …

In the style of Lindström's theorem for classical first-order logic, this article characterizes
propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract …

In computer science, various logical languages are defined to analyze properties of systems.
One way to pinpoint the essential differences between those logics is to compare their …

There are several known Lindström-style characterization results for basic modal logic. This
paper proves a generic Lindström theorem that covers any normal modal logic …

We study modal Lindström theorems from a coalgebraic perspective. We provide three
different Lindström theorems for coalgebraic logic, one of which is a direct generalisation of …

In this paper, we provide three different Lindström theorems for∃ 2bundled frag ment of
firstorder modal logic, by generalizing de Rijke's (1995) and van Benthem's (2007) results …

Abstract The Ehrenfeucht–Fraïsse game for a logic usually provides an intuitive
characterizarion of its expressive power while in abstract model theory, logics are compared …