Introduction to Discrete Structures for Computer Science and Engineering
Introduction to Discrete Structures for Computer Science and Engineering
TTL circuits for a 4-valued bus a way to reduce package and interconnections
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
An application of multiple-valued logic to a design of programmable logic arrays
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Iterative realization of multivalued logic systems
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Generalized finite Post algebras
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Analysis of a genetic programming algorithm for association studies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This paper introduces an N-valued (N&equil;2k) generalized Boolean algebra obtained by extending the set of operators of N-valued Boolean algebras. The additional operators, needed for functional completeness, are unary operators and were selected such that the basic structure and simplicity of Boolean algebras are retained. The characteristics of this switching algebra are investigated in detail and are compared with the characteristics of general N-valued algebras. It is seen that the proposed algebra is much simpler than the Post algebras and their extensions presently used and that many binary switching techniques can be generalized so that they apply to this algebra. To show this, manipulation and minimization procedures are outlined.