On the least property of the semilattice congruence on PO-semigroups (Q1386715)

The following relations are considered on an arbitrary partially ordered (p.o.) semigroup \({(S,\cdot,\leq)}\): \(a {\mathcal N} b\) if \(N(a)= N(b)\), where \(N(x)\) denotes the ordered filter of \((S, \cdot, \leq)\) generated by \(x\in S\); \(a n b\) if \(n(a) =n(b)\), where \(n(x)\) denotes the filter of \((S,\cdot)\) generated by \(x\in S\). For p.o. semigroups \(S\) with greatest element, \textit{N. Kehayopulu}, \textit{P. Kiriakuli}, \textit{S. Hanumantha Rao} and \textit{P. Lakshmi} [Semigroup Forum 41, 373-376 (1990; Zbl 0708.06011)] showed that \({\mathcal N}\) is the least semilattice congruence with the property that \(a{\mathcal N}b\), \(a\leq b\) imply \(a{\mathcal N}ab\), but that \({\mathcal N}\) is not the least semilattice congruence. In the paper under review, it is proved that both statements hold also for p.o. semigroups without greatest element. Remark: That \(n\) is the least semilattice congruence on \((S, \cdot, \leq)\) follows immediately from the description of the corresponding congruence on semigroups \((S, \cdot)\) without ordering.