- 562 pages
- English
- PDF
- Only available on web
About This Book
Computer Science and Multiple-Valued Logic: Theory and Applications focuses on the processes, methodologies, and approaches involved in multiple-valued logic and its relationship to computer science. The selection first tackles an introduction to multiple-valued logic, lattice theory of post algebras, multiple-valued logic design and applications in binary computers, smallest many-valued logic for the treatment of complemented and uncomplemented error signals, and chain based lattices. Discussions focus on formulation, representation theory, theory and circuit design, logical tables, and unary operations. The text then examines multiple-valued signal processing with limiting, development of multiple-valued logic as related to computer science, p-algebras, and an algorithm for axiomatizing every finite logic. The book takes a look at completeness properties of multiple-valued logic algebras, computer simplification of multi-valued switching functions, and minimization of multivalued functions. Topics include generation of prime implicants, realizations, minimization algorithms, decomposition algorithm for multi-valued switching functions, and relation between the sum-of-products form and array of cubes. The selection is aimed at computer engineers, computer scientists, applied mathematicians, and physicists interested in multiple-valued logic as the discipline relates to computer engineering and computer science.
Frequently asked questions
Information
Table of contents
- Front Cover
- Computer Science and Multiple-Valued Logic: Theory and Applications
- Copyright Page
- Table of Contents
- list of contributors
- Preface
- introduction
- Chapter 1. an introduction to multiple-valued logic
- Part i: algebraic theory
- Part ii: logic design and switching theory
- Part iii: threshold logic design
- Part iv: physical components and implementations
- Part v: applications