Simulating without Negation (Q4351799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1054070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulating without Negation |
scientific article; zbMATH DE number 1054070 |
Statements
Simulating without Negation (English)
0 references
24 November 1998
0 references
expressive power
0 references
modal logic
0 references
negation-free languages
0 references
directed simulations
0 references
transition systems
0 references
0 references
0.83137447
0 references
0 references
0 references
0 references
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.
0 references
