1983
DOI: 10.1007/bf02572819
|View full text |Cite
|
Sign up to set email alerts
|

Semigroups and their lattice of congruences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

1986
1986
2007
2007

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 67 publications
0
12
0
Order By: Relevance
“…Thus Remark 2.6. We remark that Theorems 2.1 and 2.5 could be deduced either from Theorem 1.21 or from Theorem 5.2 of [6]. Since the proofs of these theorems have not been published, we have given here a direct proof of our result.…”
Section: Theorem 21 Let S = [Clhjj Are Trivial For Every J E N mentioning
confidence: 87%
“…Thus Remark 2.6. We remark that Theorems 2.1 and 2.5 could be deduced either from Theorem 1.21 or from Theorem 5.2 of [6]. Since the proofs of these theorems have not been published, we have given here a direct proof of our result.…”
Section: Theorem 21 Let S = [Clhjj Are Trivial For Every J E N mentioning
confidence: 87%
“…Let S be an inverse semigroup whose semilattice of idempotents has finite length. The function rank ( ) a = h a a ( ) ⋅ −1 , where h a a ( ) ⋅ −1 is the height of the idempotent a a ⋅ −1 in the semilattice of idempotents of the semigroup S, is a rank function (see [6], p. 470]). In the present paper, the rank of an element is understood in exactly this sense.…”
Section: Terminology and Notationmentioning
confidence: 99%
“…In addition to [8], already cited above and dealing, in fact, with inverse ∆-semigroups, we can mention the known theorem (Theorem 6.3 in [5]) that gives necessary and sufficient conditions for a finite inverse semigroup to be permutable. Furthermore, results of Tamura and Hamilton immediately yield a theorem on the structure of a permutable Clifford semigroup [6, p. 34].…”
Section: Introductionmentioning
confidence: 96%
See 2 more Smart Citations