Abstract
In this paper we prove that a groupoid is term equivalent to a Boolean algebra if and only if the number of n-ary term operations of the groupoid is equal to \(2^{2^n}\) for n = 0, 1, 2 and 3. This yields a partial solution of a problem posed by Berman in 1986.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
