Classification of functions and enumeration of bases of set logic under Boolean compositions

This paper discusses some classification and enumeration problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic. B-maximal sets are maximal sets containing all Boolean functions, where Boolean functions are those obtained from /spl cup/, /spl cap/ and /sup -/ by composition (constants are not involved in the compositions). We give the number of n-place functions in each B-maximal set and find some properties of intersection of B-maximal sets in r-valued set logic. These properties are used to classify all 2-valued and 3-valued set logic functions according to the B-maximal sets to which they belong to. We prove that there are 8 and 200 such classes of functions respectively in 2-valued and 3-valued set logic. For each class of functions we give a one-place example function and its total number of one-place set logic functions. Finally, we study the B-Sheffer functions, i.e. functions which are complete under compositions with Boolean functions. We find the number of n-place B-Sheffer functions of 2-valued set logic and give a lower bound and an upper bound on the number of n-place B-Sheffer functions of 3-valued set logic. Also we enumerate all the classes of B-bases of 2-valued and 3-valued set logic.

[1]  Takafumi Aoki,et al.  Impact of interconnection-free biomolecular computing , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[2]  Michitaka Kameyama,et al.  Interconnection-free biomolecular computing , 1992, Computer.

[3]  Alioune. Ngom Set logic foundation of carrier computing. , 1995 .

[4]  Ivan Stojmenovic,et al.  Enumeration of function and bases of three-valued set logic under compositions with Boolean functions , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[5]  Dan A. Simovici,et al.  Bio-algebras , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

[6]  M. Kameyama,et al.  Prospects of multiple-valued bio-information processing systems , 1988, [1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic.

[7]  Takafumi Aoki,et al.  Design of set-valued logic networks for wave-parallel computing , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[8]  Dan A. Simovici,et al.  On the implementation of set-valued non-Boolean switching functions , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[9]  Takafumi Aoki Dreams for new-device-based superchips: from transistors to enzymes , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[10]  Michitaka Kameyama,et al.  Design of a highly parallel set logic network based on a bio-device model , 1989, Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic.

[11]  Michitaka Kameyama,et al.  Interconnection-free set logic network based on a bio-device model , 1990 .

[12]  Michitaka Kameyama,et al.  Design of interconnection-free biomolecular computing system , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[13]  I. Rosenberg,et al.  completeness properties of multiple-valued logic algebras , 1977 .

[14]  I. Stojmenovic Completeness criteria in many-valued set logic under compositions with Boolean functions , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[15]  Ivan Stojmenovic,et al.  On set-valued functions and Boolean collections , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[16]  Takafumi Aoki,et al.  Design of a set logic network based on frequency multiplexing and its applications to image processing , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[17]  Ivan Stojmenovic,et al.  Functional completeness and weak completeness in set logic , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.