Abstract
Functions of the k-valued logic with k = 2m, m > 1 are studied in the paper. Such functions are encoded in the binary numeric system and a special operation of binary superposition is defined. R is shown that the set of classes containing only the functions taking not more than two values and closed under the operations of binary superposition and adding of fictitious variables is countable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have