Reductive and weakly reductive closures of congruences on semigroups.

From MaRDI portal
Publication:2350952





A semigroup \(S\) is called a left (right) reductive semigroup if, for any elements \(a,b\in S\), the assumption ``\(xa=xb\) (\(ax=bx\)) holds for all \(x\in S\) implies \(a=b\). If \(S\) is both left and right reductive, then \(S\) is said to be reductive. If, for every elements \(a,b\in S\), the assumption ``\(xa=xb\) and \(ax=bx\) hold for all \(x\in S\) implies \(a=b\), then \(S\) is said to be weakly reductive. Clearly a reductive semigroup is also weakly reductive. A congruence \(\alpha\) on a semigroup \(S\) is called a (left, right, weakly) reductive congruence, if the factor semigroup \(S/\alpha\) is (left, right, weakly) reductive. \textit{A. Nagy} [in Semigroup Forum 87, No. 1, 129-148 (2013; Zbl 1301.20057)] investigated the left reductive closures of congruences of semigroups. In the present paper, these investigations are extended to weakly reductive, respectively, reductive closures of congruences of semigroups.











This page was built for publication: Reductive and weakly reductive closures of congruences on semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350952)