Title :
Not Finitely Definable Partial Clones on a Finite Set
Author_Institution :
Bayard Rustin Ed. Complex, New York, NY, USA
Abstract :
By establishing the relational theory of extendable partial clones on a finite set we describe infinite descending chains of partial clones whose intersection cannot be determined by a finite set of relations (we call them not finitely definable). A special type of such chains introduced in case of clones by I. Rosenberg (1972) as a generalization of two Post clones is investigated.
Keywords :
multivalued logic; extendable partial clones; finite set; infinite descending chains; k-valued logic; not finitely definable partial clones; post clone generalization; relational theory; Boolean functions; Calculus; Cloning; Cybernetics; Finite element analysis; Lattices; Galois connection; extendable partial clone; invariant relation;
Conference_Titel :
Multiple-Valued Logic (ISMVL), 2013 IEEE 43rd International Symposium on
Conference_Location :
Toyama
Print_ISBN :
978-1-4673-6067-8
Electronic_ISBN :
0195-623X
DOI :
10.1109/ISMVL.2013.41
