Selection and implementation of a ternary switching algebra
Robert L. Herrmann · 1968
During the last few years there has been a growing interest in non-binary switching algebras. A number of such algebras have been proposed, but so far they have had little application. Requirements for a switching algebra include economical circuits for the basic operations, the ability to implement an arbitrary function with a resonable number of basic circuits, and a suitable set of rules to allow the logic designer to form and manipulate expressions without undue mathematical gymnastics. These are rather vague criteria for a practical switching algebra, but they do serve as guidelines for attempts to establish suitable algebras.