Title :
A note on finite clones containing all permutations
Author :
Haddad, L. ; Rosenberg, I.G.
Author_Institution :
Dept. of Math., Toronto Univ., Ont., Canada
Abstract :
Let A be a finite set with |A|>2. The authors describe all clones on A containing the set SA of all permutations of A among its unary operations. (A clone on A is a composition closed set of finitary operations on A containing all projections.) With a few exceptions such a clone C is either essentially unary or cellular. The exceptions are subclones of Burle´s clone or of its variant (provided |A| is even)
Keywords :
formal logic; set theory; Burle´s clone; cellular; finitary operations; finite clones; finite set; permutations; unary operations; Algebra; Artificial intelligence; Boolean functions; Cloning; Delay; Hydrogen; Lattices; Logic circuits; Mathematics; Switching circuits;
Conference_Titel :
Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
Conference_Location :
Charlotte, NC
Print_ISBN :
0-8186-2046-3
DOI :
10.1109/ISMVL.1990.122590
