Axiomatizability of representable domain algebras

DOI10.1016/j.jlap.2010.07.019zbMath1207.68207OpenAlexW1981419337MaRDI QIDQ624383

Szabolcs Mikulás, Robin Hirschl

Publication date: 9 February 2011

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.019

zbMATH Keywords

automated reasoningrelation algebrasfinite axiomatizabilitydomain algebras

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (13)

Axioms for signatures with domain and demonic composition ⋮ On the variety generated by generalized subreducts of Tarski's algebras of relations ⋮ On the complexity of Kleene algebra with domain ⋮ Domain range semigroups and finite representations ⋮ Free Kleene algebras with domain ⋮ Ordered domain algebras ⋮ On Jónsson's problem for groupoids of relations with operation of binary cylindrification ⋮ How to generalise demonic composition ⋮ Domain and range for angelic and demonic compositions ⋮ Monoids with tests and the algebra of possibly non-halting programs ⋮ On algebras of binary relations with conjunctive operations ⋮ On generalized subreducts of Tarski's algebras of relations with the operation of bi-directional intersection ⋮ On classes of generalized subreducts of Tarski's relation algebras with one Diophantine binary operation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equational properties of Kleene algebras of relations with conversion
• Relation algebras by games
• Algebras of modal operators and partial correctness
• Relation algebras
• Model theory.
• Dynamic algebras: Examples, constructions, applications
• An equational axiomatization of dynamic negation and relational composition
• Classical and new paradigms of computation and their complexity hierarchies. Papers of the conference ``Foundations of the formal sciences III, Vienna, Austria, September 21-24, 2001.
• Axiomatizability of reducts of algebras of relations
• Representations of distributive lattice-ordered semigroups with binary relations
• Representable semilattice-ordered monoids
• Modal Semirings Revisited
• Domain and Antidomain Semigroups
• Domain Axioms for a Family of Near-Semirings
• On Hoare logic and Kleene algebra with tests
• On the Representation of Kleene Algebras with Tests

This page was built for publication: Axiomatizability of representable domain algebras