Logics of time and computation
Logics of time and computation
Dynamic Relation Logic Is the Logic of DPL-Relations
Journal of Logic, Language and Information
Dynamic Negation, the One and Only
Journal of Logic, Language and Information
Journal of Logic, Language and Information
Navigational XPath: calculus and algebra
ACM SIGMOD Record
Domain and Antidomain Semigroups
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Journal of Logic, Language and Information
Hi-index | 0.00 |
We consider algebras on binary relations with two main operators: relational composition and dynamic negation. Relational composition has its standard interpretation, while dynamic negation is an operator familiar to students of Dynamic Predicate Logic (DPL) (Groenendijk and Stokhof, 1991): given a relation R its dynamic negation ∼R is a test that contains precisely those pairs (s,s) for which s is not in the domain of R. These two operators comprise precisely the propositional part of DPL.This paper contains a finite equational axiomatization for these ’dynamic relation algebras‘. The completenessresult uses techniques from modal logic. We also lookat the variety generated by the class of dynamic relation algebras and note that there exist nonrepresentable algebras in this variety, ones which cannot be construedas spaces of relations. These results are also proved for an extension to a signature containing atomic tests and union.