Refine
Has Fulltext
- no (2)
Document Type
- Article (1)
- Doctoral Thesis (1)
Language
- English (2)
Is part of the Bibliography
- yes (2)
Keywords
Institute
- Institut für Mathematik (2) (remove)
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.