Abstract

Let θ and ρ be a nontrivial equivalence relation and a binary relation on a finite set A, respectively. It is known from Rosenberg’s classification theorem (1965) that the clone Pol θ, which consists of all operations on A that preserve θ, is among the maximal clones on A. In the present paper, we find all binary relations ρ such that the clone Pol ρ is a meet-irreducible maximal subclone of Pol θ.

Full Text
Paper version not known

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

Disclaimer: 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.