DocumentCode
1964022
Title
A note on finite clones containing all permutations
Author
Haddad, L. ; Rosenberg, I.G.
Author_Institution
Dept. of Math., Toronto Univ., Ont., Canada
fYear
1990
fDate
23-25 May 1990
Firstpage
34
Lastpage
41
Abstract
Let A be a finite set with |A |>2. The authors describe all clones on A containing the set S A 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;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
Conference_Location
Charlotte, NC
Print_ISBN
0-8186-2046-3
Type
conf
DOI
10.1109/ISMVL.1990.122590
Filename
122590
Link To Document