We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are ...

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are ...

Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped ...

We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ...

We investigate dynamic modal operators that can changethe model during evaluation. We define the logicSLby extending thebasic modal language with the♦modality, which is a diamond operatorthat in addition has the ...

Over the last years, the study of logics that can update a model while evaluating a formula has gained in interest. Motivated by many examples in practice such as hybrid logics, separation logics and dynamic epistemic ...

We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the ...

Continuos-discrete processes are characterized by the strong coupling of continuos state dynamics of recipe-driven discontinuos operations and the discrete state dynamics of logic-based controllers acting at the interface ...