Representations of distributive lattice-ordered semigroups with binary relations
This paper studies the problem of representing (semi) lattice-ordered semigroups by binary relations. Let R be the class of all algebras which are isomorphic to structures whose elements are binary relations together with the operations of union, intersection and composition of relations. It is shown that R is not a variety and that it is not finitely axiomatizable. The variety generated by R is proved to be the class of all distributive lattice-ordered semigroups by showing that every free member of the latter class is representable. More generally, it is proved that every semilattice-ordered semigroup whose semilattice is distributive, is representable as a semigroup of binary relations endowed with the operations of union and composition. The class of all these latter algebras was previously shown by \textit{D. A. Bredihin} and \textit{B. M. Schein} [Colloq. Math. 39, 1-12 (1978; Zbl 0389.06013)] to coincide with the class of all semilattice-ordered semigroups.
- On representing semigroups with subsemilattices.
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Binary relations as lattice isomorphisms
- On partially ordered semigroups of relations with domino operations.
- Representations of ordered doppelsemigroups by binary relations
- Modal languages and bounded fragments of predicate logic
- Notions of density that imply representability in algebraic logic
- Lambek calculus and its relational semantics: Completeness and incompleteness
- On quasi-identities of relation algebras with Diophantine operations
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- The equational logic of fixed points
- Domain and range for angelic and demonic compositions
- On generalized subreducts of Tarski's algebras of relations with the operation of bi-directional intersection
- Decision problems for distributive lattice-ordered semigroups
- The equational theory of union-free algebras of relations
- Taming logic
- On algebras of binary relations with conjunctive operations
- Equational theories for automata
- On Jónsson's problem for groupoids of relations with operation of binary cylindrification
- Monoids with tests and the algebra of possibly non-halting programs
- On classes of generalized subreducts of Tarski's relation algebras with one Diophantine binary operation
- The lattice of ai-semiring varieties satisfying \(x^n \approx x\) and \(xy \approx yx\)
- On varieties of ordered semigroups.
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Axioms for signatures with domain and demonic composition
- Positive fragments of relevance logic and algebras of binary relations
- Images n-commutative semigroups of binary relations.
- The Structure of the One-Generated Free Domain Semiring
- On representing semigroups with subsemilattices.
- BINARY REPRESENTATIONS OF ALGEBRAS WITH AT MOST TWO BINARY OPERATIONS: A CAYLEY THEOREM FOR DISTRIBUTIVE LATTICES
- scientific article; zbMATH DE number 4087737 (Why is no real title available?)
- Undecidability of representability as binary relations
- Reasoning with graphs
- Completeness for identity-free Kleene lattices
- On the Representation of Boolean Magmas and Boolean Semilattices
- Representations of ordered doppelsemigroups by binary relations
- REPRESENTATIONS OF ORDERED DIMONOIDS BY BINARY RELATIONS
- On the variety generated by generalized subreducts of Tarski's algebras of relations
- Axiomatizability of representable domain algebras
- Axiomatizability of positive algebras of binary relations
- Equational properties of Kleene algebras of relations with conversion
- On groupoids associated with involution semigroups
- On graph reasoning
This page was built for publication: Representations of distributive lattice-ordered semigroups with binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277499)
