Representations of ordered semigroups and lattices by binary relations
From MaRDI portal
Cited in
(22)- Lattices of suborders
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Agreeable semigroups.
- On generalized subreducts of Tarski's algebras of relations with the operation of bi-directional intersection
- Join-semidistributive lattices and convex geometries.
- The equational theory of union-free algebras of relations
- Verifying minimum spanning tree algorithms with Stone relation algebras
- On algebras of binary relations with conjunctive operations
- On Jónsson's problem for groupoids of relations with operation of binary cylindrification
- Rings with kernel inclusion quasiorder.
- Domain range semigroups and finite representations
- A Representation Theorem for Semilattices
- The Structure of the One-Generated Free Domain Semiring
- scientific article; zbMATH DE number 7559485 (Why is no real title available?)
- Stone relation algebras
- Every semigroup is isomorphic to a transitive semigroup of binary relations
- Axiomatizability of positive algebras of binary relations
- Quasivarieties generated by small suborder lattices. I: Equational bases
- On groupoids associated with involution semigroups
- Minimal signatures with undecidability of representability by binary relations
- Embedding lattices into derived lattices.
This page was built for publication: Representations of ordered semigroups and lattices by binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170775)