Boolean algebra and its applications / by J. Eldon Whitesitt.
Series Addison-Wesley series in the engineering sciencesElectrical and control systemsEditor: Reading, Mass. : Addison-Wesley, c1961Descripción: x, 182 p. : il. ; 24 cmOtra clasificación: 06ExxChapter 1. The Algebra of Sets [1] 1-1 Introduction [1] 1-2 Element and set [1] 1-3 The combination of sets [3] 1-4 Venn diagrams [5] 1-5 Fundamental laws [7] 1-6 Expanding, factoring, and simplifying [9] 1-7 Properties of set inclusion [12] 1-8 Conditional equations [15] 1-9 Solution of equations [19] 1- 10 The number of elements in a set [20] Chapter 2. Boolean Algebra [25] 2- 1 Introduction [25] 2-2 Preliminary definitions [25] 2-3 Definition and properties of a Boolean algebra [27] 2-4 Disjunctive normal form [33] 2-5 Conjunctive normal form [38] 2- 6 Representation of a Boolean algebra [41] Chapter 3. Symbolic Logic and the Algebra of Propositions [43] 3- 1 Introduction [43] 3-2 Propositions and definitions of symbols [43] 3-3 Truth tables [47] 3-4 Object logic and syntax logic [52] 3-5 Material implication [52] 3-6 Truth sets for propositions [56] 3-7 Quantifiers [59] 3-8 Valid arguments [61] 3-9 Indirect proofs [66] 3-10 Functionally complete sets of operations [68] 3- 11 Special problems [70] Chapter 4. Switching Algebra [75] 4- 1 Introduction [75] 4-2 Definition of the algebraic symbols [75] 4-3 Simplification of circuits [79] 4-4 Non-series-parallel circuits [94] 4-5 Design of circuits from given properties [90] 4-6 Design of n-terminal circuits [94] 4-7 Symmetric functions and their circuits [99] Chapter 5. Relay Circuits and Control Problems [104] 5-1 Introduction [104] 5-2 Basic relay control paths [106] 5-3 n-terminal circuits and the uses of transfer contacts [110] 5-4 Operate and hold paths [116] 5-5 Sequential circuits and sequence diagrams [119] 5-6 Design of sequential relay circuits from given conditions [124] 5- 7 Special problems involving the design of relay circuits [132] Chapter 6. Circuits for Arithmetic Computation [135] 6- 1 Introduction [135] 6-2 The binary number system [135] 6-3 Logical circuit elements [138] 6-4 Addition of binary numbers [142] 6-5 Subtraction of binary numbers [145] 6-6 Accumulation [147] 6- 7 Binary multiplication [150] Chapter 7. Introduction to Probability in Finite Sample Spaces [153] 7- 1 Introduction [153] 7-2 Event, sample space, probability [153] 7-3 Conditional probability [157] 7-4 Some aids to counting [150] 7-5 Bernoulli trials, binomial distribution [163] Answers to Selected Problems [168]
| Item type | Home library | Shelving location | Call number | Materials specified | Status | Date due | Barcode | Course reserves |
|---|---|---|---|---|---|---|---|---|
Libros
|
Instituto de Matemática, CONICET-UNS | Libros ordenados por tema | 06 W594 (Browse shelf) | Available | A-3718 |
Chapter 1. The Algebra of Sets [1] --
1-1 Introduction [1] --
1-2 Element and set [1] --
1-3 The combination of sets [3] --
1-4 Venn diagrams [5] --
1-5 Fundamental laws [7] --
1-6 Expanding, factoring, and simplifying [9] --
1-7 Properties of set inclusion [12] --
1-8 Conditional equations [15] --
1-9 Solution of equations [19] --
1- 10 The number of elements in a set [20] --
Chapter 2. Boolean Algebra [25] --
2- 1 Introduction [25] --
2-2 Preliminary definitions [25] --
2-3 Definition and properties of a Boolean algebra [27] --
2-4 Disjunctive normal form [33] --
2-5 Conjunctive normal form [38] --
2- 6 Representation of a Boolean algebra [41] --
Chapter 3. Symbolic Logic and the Algebra of Propositions [43] --
3- 1 Introduction [43] --
3-2 Propositions and definitions of symbols [43] --
3-3 Truth tables [47] --
3-4 Object logic and syntax logic [52] --
3-5 Material implication [52] --
3-6 Truth sets for propositions [56] --
3-7 Quantifiers [59] --
3-8 Valid arguments [61] --
3-9 Indirect proofs [66] --
3-10 Functionally complete sets of operations [68] --
3- 11 Special problems [70] --
Chapter 4. Switching Algebra [75] --
4- 1 Introduction [75] --
4-2 Definition of the algebraic symbols [75] --
4-3 Simplification of circuits [79] --
4-4 Non-series-parallel circuits [94] --
4-5 Design of circuits from given properties [90] --
4-6 Design of n-terminal circuits [94] --
4-7 Symmetric functions and their circuits [99] --
Chapter 5. Relay Circuits and Control Problems [104] --
5-1 Introduction [104] --
5-2 Basic relay control paths [106] --
5-3 n-terminal circuits and the uses of transfer contacts [110] --
5-4 Operate and hold paths [116] --
5-5 Sequential circuits and sequence diagrams [119] --
5-6 Design of sequential relay circuits from given conditions [124] --
5- 7 Special problems involving the design of relay circuits [132] --
Chapter 6. Circuits for Arithmetic Computation [135] --
6- 1 Introduction [135] --
6-2 The binary number system [135] --
6-3 Logical circuit elements [138] --
6-4 Addition of binary numbers [142] --
6-5 Subtraction of binary numbers [145] --
6-6 Accumulation [147] --
6- 7 Binary multiplication [150] --
Chapter 7. Introduction to Probability in Finite Sample Spaces [153] --
7- 1 Introduction [153] --
7-2 Event, sample space, probability [153] --
7-3 Conditional probability [157] --
7-4 Some aids to counting [150] --
7-5 Bernoulli trials, binomial distribution [163] --
Answers to Selected Problems [168] --
MR, 27 #3571
Click on an image to view it in the image viewer
There are no comments on this title.