section 3.4 boolean algebra. a link between: section 1.3: logic systems section 3.3: set systems...

17
Section 3.4 Boolean Algebra

Upload: marshall-banks

Post on 18-Jan-2016

212 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Section 3.4

Boolean Algebra

Page 2: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Boolean Algebra

A link between:Section 1.3: Logic SystemsSection 3.3: Set Systems

Application:Section 3.5: Logic Circuits in Computer

Science

Page 3: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Recall:

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

Page 4: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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:

Page 5: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

Page 6: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Similarity between the theorems:

Change p,q,r to A, B, C Change to Change to Change to Change to = Change t to U Change c to {}

'

Page 7: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

)()( prqp

Page 8: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

)(')'( BAABA

Page 9: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Practice: Verify by quoting logic properties

that =_______________________ by

=_______________________by

=_______________________by

=_______________________by

=_______________________by

=

pqqpq )(

qpq )(

pq

Page 10: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

Page 11: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Connections between Logic, Sets, and Boolean Algebra

Page 12: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

Properties of a Boolean AlgebraCompare this to the properties for sets and logic.

Page 13: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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)

)'()( ABAABA

tqpqp )()(

Page 14: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

abbaa )(

Page 15: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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

bcabcab )(

Page 16: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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.

Page 17: Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer

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.

)1)(( cba 0 cab