scientific article; zbMATH DE number 4017196
Let S be a semigroup and \(L\subseteq S\). Consider the congruence \(\equiv\) on S which is defined by the following condition: \[ x\equiv y\quad \Leftrightarrow \quad \forall u,v\in S^ 1\quad uxv\in L\quad \leftrightarrow \quad uyv\in L. \] The set L is said to be disjunctive if and only if \(\equiv\) is the equality relation. Note that there are several non-equivalent definitions of disjunctivity in the literature! A finitely generated semigroup has a disjunctive subset if and only if it is isomorphic with the syntactic semigroup of a language. This is one of the reasons, why characterizing the disjunctive subsets of a semigroup is of considerable interest. It is well-known that not every semigroup has a disjunctive subset [see for example: \textit{H. Jürgensen}, \textit{G. Thierrin}, Elektron. Informationsverarbeitung Kybernetik 22, 513-526 (1986)]. The main result of this paper is a characterization of disjunctive subsets in semigroups which can be ``exhausted by ideals, that is, ordered in such a way that the sets \(\{x_{\lambda}|\lambda <\alpha \}\) form ideals. This generalizes previous results on disjunctive subsets in semilattices by the author [Arch. Math., Brno 9, 73-82 (1973; Zbl 0282.06005)] and the reviewer [Acta Math. Acad. Sci. Hung. 31, 37-41 (1978; Zbl 0386.20038)].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3029207)