Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions ...