Representations of ordered semigroups and lattices by binary relations

DOI10.4064/CM-39-1-1-12zbMATH Open0389.06013OpenAlexW234549357MaRDI QIDQ4170775FDOQ4170775

Authors: D. A. Bredikhin, Boris M. Schein 

Publication date: 1978

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/143615

Mathematics Subject Classification ID

Representation theory of lattices (06B15) Ordered semigroups and monoids (06F05)

Cited In (20)

• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• A Representation Theorem for Semilattices
• The Structure of the One-Generated Free Domain Semiring
• Quasivarieties generated by small suborder lattices. I: Equational bases
• Title not available (Why is that?)
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Lattices of suborders
• On algebras of binary relations with conjunctive operations
• Join-semidistributive lattices and convex geometries.
• On Jónsson's problem for groupoids of relations with operation of binary cylindrification
• Embedding lattices into derived lattices.
• The equational theory of union-free algebras of relations
• Domain range semigroups and finite representations
• On generalized subreducts of Tarski's algebras of relations with the operation of bi-directional intersection
• Lambek calculus and its relational semantics: Completeness and incompleteness
• Axiomatizability of positive algebras of binary relations
• Every semigroup is isomorphic to a transitive semigroup of binary relations
• Rings with kernel inclusion quasiorder.
• Agreeable semigroups.
• Stone relation algebras

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)