1. Section 3.4 Boolean Algebra

2. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer Science

3. Recall: We have already studied two systems: logic and sets, and have observed several properties that each system possesses.

4. Theorem 2, Section 1.3: Let p, q, r be propositions, and let t indicate a tautology and c a contradiction. The logical equivalences shown below hold:

5. Theorem 6, Section 3.3: For sets A, B, and C, the universal set U and the empty set, the following properties hold:

6. Similarity between the theorems: Change p,q,r to A, B, C Change to Change to = Change t to U Change c to {}

7. Practice: Convert the logical expression to set theory notation, using sets A,B, and C:

8. Practice: Convert the set theory expression to logical notation, using logical variables, p, q, and r:

9. Practice: Verify by quoting logic properties that =_______________________ by =

10. Introduction to Boolean Algebra In the mid-1800’s, the English mathematician George Boole investigated systems having properties like those shared by sets and logic systems. We will use the following notation when describing a Boolean algebra:  lowercase letters  and + for the operations  0 and 1 for special symbols

11. Connections between Logic, Sets, and Boolean Algebra

12. Properties of a Boolean Algebra Compare this to the properties for sets and logic.

13. Any logical expression or expression of set theory can be written using Boolean algebra notation. Write the following using Boolean algebra notation, with variables a and b: 1) 2)

14. Verify the following Boolean algebra equality by quoting properties of a Boolean algebra:

16. Advantages of the Boolean algebra system: Some properties are analogous to familiar properties in algebra, e.g. the distributive, commutative, and associative properties. Symbolic manipulation is easier with a Boolean system than with a logic or set system.

17. Duality The dual of a Boolean algebra expression is obtained by interchanging the roles of and +, and also interchanging the roles of 0 and1. Example: The dual of is Theorem: For every true equality in a Boolean algebra, the “dual” of that property is also true.