Abstract
Any clones on arbitrary set A can be written of the form Pol (A)Q for some set Q of relations on A. We consider clones of the form Pal (A)Q where Q is a set of unary relations on a finite set A. A clone Pol (A)Q is said to be a clone on a set of the smallest cardinality with respect to category equivalence if vertical bar A vertical bar <= vertical bar S vertical bar for all finite sets S and all clones C on S that category equivalent to Pol (A)Q. We characterize the clones on a set of the smallest cardinality with respect to category equivalent and show how we can find a clone on a set of the smallest cardinality that category equivalent to a given clone.
Sign-in/Register to access full text options 
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.
