Simulating without Negation

From MaRDI portal
Publication:4351799





Inspired by the role of bisimulations in the understanding of the expressive power of modal languages, the authors introduce the (weaker) notion of `directed simulations', which they show similarly suitable to reason about negation-free fragments of modal languages. For a simple, negation-free, propositional modal language, they show an expressivity result -- the relation to the first-order formulas which are preserved under directed simulations. They also characterize `safe' formulas (in the sense of \textit{J. van Benthem}, Exploring logical dynamics (1996; Zbl 0873.03001)) with respect to directed simulations, and also address definability questions for classes of transition systems. Finally, they sketch the connections to stronger negation-free languages, and discuss some nonclassical negations as well.











This page was built for publication: Simulating without Negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351799)