A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
From MaRDI portal
Publication:2543990
DOI10.1007/BF02573047zbMath0211.03902MaRDI QIDQ2543990
Publication date: 1970
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133801
Related Items (8)
A matrix characterization of the maximal groups in $\beta_X$ ⋮ Semigroups generated by partitions ⋮ Any group is a maximal subgroup of the semigroup of binary relations on some set ⋮ Representation theory of finite semigroups over semirings. ⋮ Finite binary relations have no more complexity than finite functions ⋮ A. H. Clifford: An appreciation of his work on the occasion of his sixty- fifth birthday ⋮ A proof of Devadze's theorem on generators of the semigroup of Boolean matrices. ⋮ Combinatorial properties of binary semigroups
Cites Work
This page was built for publication: A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations