The concept of a functionally complete set is defined and examples are given in the familiar field of 2-valued logic and 2-valued switching circuits. Several functionally complete sets, already Known to investigators in n-valued logic, are discussed, with particular emphasis on applications to the synthesis of n-valued switching circuits. It is noted that much of the switching in a base-n computer will be, in a sense, binary, permitting the use of relatively simple elements in the synthesis. As an example, an n-valued switching matrix is synthesized.
['Ragnar Berlin']
Synthesis of N-Valued Switching Circuits