Description: Chapter 1. The Algebra of Sets 1.1 Introduction 1.2 Element and set 1.3 The Combination of sets 1.4 Venn diagrams 1.5 Fundamental laws 1.6 Expanding, factoring, and simplifying 1.7 Properties of set inclusion 1.8 Conditional equations 1.9 Solution of equations 1.10 The number of elements in a set Chapter 2. Boolean Algebra 2.1 Introduction 2.2 Preliminary definitions 2.3 Definition and properties of a Boolean algebra 2.4 Disjunctive normal form 2.5 Conjunctive normal form 2.6 Representation of a Boolean algebra Chapter 3. Symbolic Logic and the Algebra of Propositions 3.1 Introduction 3.2 Propositions and definitions of symbols 3.3 Truth tables 3.4 Object logic and syntax logic 3.5 Material implication 3.6 Truth sets of propositions 3.7 Quantifiers 3.8 Valid arguments 3.9 Indirect proofs 3.10 Functionally complete sets of operations 3.11 Special problems Chapter 4. Switching Algebra 4.1 Introduction 4.2 Definition of the algebraic symbols 4.3 Simplification of circuits 4.4 Non-series-parallel circuits 4.5 Design of circuits from given properties 4.6 Design of n-terminal circuits 4.7 Symmetric functions and their circuits Chapter 5. Relay Circuits and Control Problems 5.1 Introduction 5.2 Basic relay control paths 5.3 n-terminal circuits and the uses of transfer contacts 5.4 Operate and hold paths 5.5 Sequential circuits and sequence diagrams 5.6 Design of sequential relay circuits from given conditions 5.7 Special problems involving the design of relay circuits Chapter 6. Circuits for Arithmetic Computation 6.1 Introduction 6.2 The binary number system 6.3 Logical circuit elements 6.4 Addition of binary numbers 6.5 Subtraction of binary numbers 6.6 Accumulation 6.7 Binary multiplication Chapter 7. Introduction to Probability in Finite Sample Spaces 7.1 Introduction 7.2 Event, sample space, probability 7.3 Conditional probability 7.4 Some aids to counting 7.5 Bernoulli trials, binomial distribution Answers to Selected Problems; Index

Please Wait