A non-commutative multiple-valued logic

Abstract

A set of operations which can be used to design n-valued switching functions is given. These give rise to a class of algebras which are left-handed skew lattices together with dual implication operation. Such algebras form a decidable discriminator variety, and hence possess a well-behaved structure theory and satisfy many identities. Algorithms for the design and optimization of switching functions are outlined.<>