Simulating without Negation

DOI10.1093/logcom/7.4.501zbMath0904.03008OpenAlexW2109102460MaRDI QIDQ4351799

Natasha Kurtonina, Maarten de Rijke

Publication date: 24 November 1998

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://pure.uva.nl/ws/files/4048767/2898_27680y.pdf

zbMATH Keywords

modal logicexpressive powertransition systemsdirected simulationsnegation-free languages

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Bisimilarity for paraconsistent description logics ⋮ The Range of Modal Logic ⋮ Bi-simulating in bi-intuitionistic logic ⋮ Model theory of XPath on data trees. II: Binary bisimulation and definability ⋮ A Lindström theorem for intuitionistic propositional logic ⋮ A Lindström theorem for intuitionistic first-order logic ⋮ INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY ⋮ Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics ⋮ Characterization, definability and separation via saturated models ⋮ Notational variance and its variants ⋮ THE RELEVANT FRAGMENT OF FIRST ORDER LOGIC ⋮ On Characterization, Definability and ω-Saturated Models ⋮ Expressiveness of concept expressions in first-order description logics

This page was built for publication: Simulating without Negation