Logic functions and equations : binary models for computer science /: binary models for computer science. ([2019])
- Record Type:
- Book
- Title:
- Logic functions and equations : binary models for computer science /: binary models for computer science. ([2019])
- Main Title:
- Logic functions and equations : binary models for computer science
- Further Information:
- Note: Christian Posthoff, Bernd Steinback.
- Authors:
- Posthoff, Christian
Steinbach, Bernd - Contents:
- Intro; Foreword; Preface; Contents; Acronyms; Part I Theoretical Foundations; 1 Basic Algebraic Structures; 1.1 The Roots of Logic Concepts; 1.2 The Set B; 1.3 Boolean Algebras; 1.4 The Set Bn; 2 Logic Functions; 2.1 Logic Functions; 2.2 Formulas and Expressions; 2.3 Special Logic Functions; 2.4 Minimization Problems; 2.5 Complete Systems of Functions; 3 Logic Equations; 3.1 Basic Problems and Definitions; 3.2 Systems of Equations and Inequalities; 3.3 Ternary Vectors as the Main Data Structure; 3.4 The Solution of Simple Equations; 3.5 Operations with Solution Sets 3.6 Special Equation Systems; 4 Boolean Differential Calculus; 4.1 Preliminaries; 4.2 Vectorial Derivative Operations; 4.3 Single Derivative Operations; 4.4 k-Fold Derivative Operations; 4.5 Differential of a Boolean Variable; 4.6 Differential Operations of Logic Functions; 5 Sets, Lattices, and Classes of Logic Functions; 5.1 Partially Defined Functions: Lattices of Functions; 5.2 Generalized Lattices of Logic Functions; 5.3 Derivative Operations of Lattices of Logic Functions; 5.4 Solution of Equations with Regard to Variables; 5.5 Relations Between Lattices of Solution Functions 5.6 Functional Equations5.7 Boolean Differential Equations; Part II Applications; 6 Logic, Arithmetic, and Special Functions; 6.1 Propositional Logic; 6.2 Binary Arithmetic; 6.3 Coding; 6.4 Specific Normal Form; 6.5 Most Complex Logic Functions; 6.6 Bent Functions; 7 SAT-Problems; 7.1 Specification and Solution Methods; 7.2 ComplexityIntro; Foreword; Preface; Contents; Acronyms; Part I Theoretical Foundations; 1 Basic Algebraic Structures; 1.1 The Roots of Logic Concepts; 1.2 The Set B; 1.3 Boolean Algebras; 1.4 The Set Bn; 2 Logic Functions; 2.1 Logic Functions; 2.2 Formulas and Expressions; 2.3 Special Logic Functions; 2.4 Minimization Problems; 2.5 Complete Systems of Functions; 3 Logic Equations; 3.1 Basic Problems and Definitions; 3.2 Systems of Equations and Inequalities; 3.3 Ternary Vectors as the Main Data Structure; 3.4 The Solution of Simple Equations; 3.5 Operations with Solution Sets 3.6 Special Equation Systems; 4 Boolean Differential Calculus; 4.1 Preliminaries; 4.2 Vectorial Derivative Operations; 4.3 Single Derivative Operations; 4.4 k-Fold Derivative Operations; 4.5 Differential of a Boolean Variable; 4.6 Differential Operations of Logic Functions; 5 Sets, Lattices, and Classes of Logic Functions; 5.1 Partially Defined Functions: Lattices of Functions; 5.2 Generalized Lattices of Logic Functions; 5.3 Derivative Operations of Lattices of Logic Functions; 5.4 Solution of Equations with Regard to Variables; 5.5 Relations Between Lattices of Solution Functions 5.6 Functional Equations5.7 Boolean Differential Equations; Part II Applications; 6 Logic, Arithmetic, and Special Functions; 6.1 Propositional Logic; 6.2 Binary Arithmetic; 6.3 Coding; 6.4 Specific Normal Form; 6.5 Most Complex Logic Functions; 6.6 Bent Functions; 7 SAT-Problems; 7.1 Specification and Solution Methods; 7.2 Complexity and NP-Completeness; 7.3 Placement Problems; 7.4 Covering Problems; 7.5 Path Problems; 7.6 Coloring Problems; 8 Extremely Complex Problems; 8.1 Rectangle-Free Four-Colored Grids; 8.2 Discussion of the Complexity; 8.3 Basic Approaches and Results 8.4 Construction of Four-Colored Grids G16, 16 and G16, 208.5 Solution of All Four-Colored Grids up to 18 18; 8.6 Solution of Four-Colored Grids with the Size 12 21; 9 Combinational Circuits; 9.1 The Circuit Model; 9.2 Analysis; 9.3 Covering Methods for Synthesis; 9.4 Decomposition Methods for Synthesis; 9.5 Test; 10 Sequential Circuits; 10.1 The Circuit Model; 10.2 Analysis of Asynchronous Sequential Circuits; 10.3 Analysis of Synchronous Sequential Circuits; 10.4 Synthesis of Asynchronous Finite-State Machines; 10.5 Synthesis of Synchronous Finite-State Machines 10.6 Hardware Software Co-DesignReferences; Index … (more)
- Edition:
- Second edition
- Publisher Details:
- Cham, Switzerland : Springer
- Publication Date:
- 2019
- Extent:
- 1 online resource (xvi, 508 pages)
- Subjects:
- 511.3/24
Algebra, Boolean
Logic, Symbolic and mathematical
Machine theory
Logic, Symbolic and mathematical
Electronic books - Languages:
- English
- ISBNs:
- 9783030024208
3030024202 - Related ISBNs:
- 9783030024192
- Notes:
- Note: Includes bibliographical references and index.
Note: Description based on online resource; title from digital title page (viewed on February 13, 2019). - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.381936
- Ingest File:
- 02_366.xml