scientific article; zbMATH DE number 7559485
From MaRDI portal
Publication:5089295
Cites work
- Allegories: decidability and graph homomorphisms
- Axiomatizability of positive algebras of binary relations
- Completeness for identity-free Kleene lattices
- Concurrent Kleene algebra and its foundations
- Conjunctive query containment revisited
- Equational properties of Kleene algebras of relations with conversion
- Equational theory of relation algebras with positive operations
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 7559485 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- On representable relation algebras
- Partial derivatives on graphs for Kleene allegories
- Petri Automata for Kleene Allegories
- Relation algebras
- Representations of ordered semigroups and lattices by binary relations
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The equational theory of pomsets
- The equational theory of union-free algebras of relations
Cited in
(4)- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}
- The class of representable semilattice-ordered monoids is not a variety
- scientific article; zbMATH DE number 7559485 (Why is no real title available?)
- Yet some more non-finite axiomatizability results for algebras of relations and ways to avoid them
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089295)