Cargando…
Computer science and multiple-valued logic : theory and applications /
Computer Science and Multiple-Valued Logic.
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam : New York :
North-Holland Pub. Co. ; Sole distributors for the U.S.A. and Canada, Elsevier/North-Holland, Inc.,
1977.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- 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; Chapter 2. from fixed to mixed radix; the lattice theory of post algebras; 1. Introduction; 2. Notation; 3. Formulation; 4. Post functions; 5. Examples; 6. Representation theory; 7. Completeness properties; References; multiple-valued logic design and applications in binary computers; Introduction; Theory and logic design; Theory and circuit design
- ApplicationsConclusions; References; the smallest many-valued logic for the treatment of complemented and uncomplemented error signals; 1. Introduction; 2. Logical tables; 3. Algebra; 4. Unary operations; 5. Example; 6. Summary; References; Chain based lattices; 1. Definitions; 2. Po-lattices; 3. P1-lattices; 4. P2-lattices; 5. Axioms and P2-functions; 6. Applications; 7. Prime ideals; References; Chapter 3. decisive implication; multiple-valued signal processing with limiting; 1. Introduction; 2. Processing elements; 3. Algebra; 4. Propositional calculus; 5. Summary; References
- The development of multiple-valued logic as related to computer science1. Introduction; 2. Background; 4. Programming; 5. Full scale implementations; 6. Further developments; Acknowledgements; References; References to Bibliographies; References to Symposia; P-algebras, an abstraction from post algebras; 1. Introduction; 2. Preliminaries; 3. Characterizations of P-algebras; 4. Representation theorem; 5. Free P-algebras; 7. P-subalgebras of Post algebras of order n; References; Chapter 4. post algebras through P0 and P1 lattices; 0. Introduction; 1. Po-lattices; 2. P1-lattices
- 3. Post algebras of order n Elementary properties; 4. Algebraic characterization of Post algebras; 5. Filters in Post algebras; 6. Quotient Post algebras; 7. Homomorphism in Post algebras; 8. Post field of sets. Representation theorem; 9. Post functions; References; Chapter 5. an algorithm for axiomatizing every finite logic; 1. Introduction; 2. Language S; 3. Logic over E; 4. Completeness; 5. Examples; 6. A final remark; References; Chapter 6. completeness properties of multiple-valued logic algebras; 1. Introduction; 2. Preliminaries; 3. Completeness (primality)
- 4. Completeness with constants5. Sheffer functions; 6. The Galois theory of operations versus relations; 7. The lattice Pk of polynomial classes; Bibliography; Part ii: logic design and switching theory; Chapter 7. computer simplification of multi-valued switching functions; 1. Introduction; 2. Basic definitions and theorem; 3. Compound literals; 4. Cubical representation; 5. Relation between the sum-of-products form and array of cubes; 6. Minimization algorithms; 7. Statistical results from computer execution; 8. Decomposition algorithm for multi-valued switching functions; 9. Conclusion