Abstract
The problem of characterizing the semigroups with Boolean congruence lattices has been solved for several classes of semigroups. Hamilton [9] and the author of this paper [1] studied the question for semilattices. Hamilton and Nordahl [10] considered commutative semigroups, Fountain and Lockley [7,8] solved the problem for Clifford semigroups and idempotent semigroups, in [1] the author generalized their results to completely regular semigroups. Finally, Zhitomirskiy [19] studied the question for inverse semigroups.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
