Scribd
Upload
6 views22 pages

Lecture 05 - Boolean Algebra

Boolean algebra involves variables that take on truth values, true (1) and false (0), and includes operations such as complementation, Boolean sum (OR), and Boolean product (AND). The document provides definitions, examples, and exercises related to these operations, as well as Boolean identities, sum-of-products, product-of-sums, and the duality principle. It emphasizes the simplification of Boolean expressions and the representation of Boolean functions.

Uploaded by

dreamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views22 pages

Lecture 05 - Boolean Algebra

Boolean algebra involves variables that take on truth values, true (1) and false (0), and includes operations such as complementation, Boolean sum (OR), and Boolean product (AND). The document provides definitions, examples, and exercises related to these operations, as well as Boolean identities, sum-of-products, product-of-sums, and the duality principle. It emphasizes the simplification of Boolean expressions and the representation of Boolean functions.

Uploaded by

dreamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Boolean

Algebra
Boolean Algebra

Boolean algebra is the category of algebra in which the variable’s values


are the truth values, true and false, ordinarily denoted 1 and 0 respectively.

The three operations in Boolean algebra that we will use most are:
• Complementation
• Boolean sum
• Boolean product
Complement

The complement of an element, denoted with a bar, is defined by


ഥ=1
𝟎
and
ഥ=0
𝟏

Boolean Product (AND)

The Boolean product, denoted by · or by AND, has the following values:

1.1=1 0.1=0
1.0=0 0.0=0
Boolean Sum

The Boolean sum, denoted by + or by OR, has the following values:

1+1=1 0+1=1
1+0=1 0+0=0
Example 01

Find the value of 1 · 0 + (0 + 1).

1 · 0 + (0 + 1) = 0 + 1ത
=0+0
=0
Example 02
Translate 1 · 0 + (𝟎 + 𝟏) = 0 into a logical equivalence.
We obtain a logical equivalence when we translate each 1 into a T, each
0 into an F.
Each;
➢ Boolean sum into a Disjunction
➢ Boolean product into a Conjunction
➢ Complementation into a Negation.

1 · 0 + (𝟎 + 𝟏) = 0
(T ∧ F) + ∼ ( F ∨ T) ≣ F
Example 03

Translate the logical equivalence (T ∧ T) ∨ ∼F ≡ T into an


identity in Boolean algebra

(T ∧ T) ∨ ∼F ≡ T

(1·1)+𝟎
ഥ =1
Exercises
1. Find the values of these expressions
a) 1. 0ത e) (0 + 1)
b) 1 + 1ത f) 1 + (1.0)
c) 0.0ത g) 0 . (1 + 1ത )
d) 1 + 0ത

2. Find the values, if any, of the Boolean variable x that satisfy these
equations.
a) 𝑥 · 1 = 0 c) 𝑥 · 1 = 𝑥
b) x + x = 0 d) 𝑥 · 𝑥ҧ = 𝑥
Boolean Identities
Boolean Identities
Example 01

Verifying the Distributive Law x(y+z) = x.y + x.z


Example 02
Simplify the expression A.(A + B)using Boolean identities.

A.(A + B) = A.(A + B)
= A.A + A.B Distributive Law
}
= A + A.B Idempotent Law
= A.(1 + B)
}
= A. 1
=A
Example 03
Simplify the expression (A + B)(A + C) using Boolean identities.

(A + B)(A + C) = (A + B)(A + C)
= A (A + C) + B(A + C) Distributive Law
= A.A + A.C + B.A + B.C
} Distributive Law
= A + A.C + A.B + B.C
}}
= A + A.B + B.C Absorption Law
= A + B.C Absorption Law
Exercise
Simplify the following Boolean expressions using Boolean identities.

i. A + (𝐴ഥ 𝐵)
ii. AB(𝐵ഥ 𝐶 + 𝐴𝐶)
iii. A + B A + C + AC
iv. (𝐴 + 𝐵 + 𝐶)𝐷
v. 𝐴𝐵𝐶 + 𝐷𝐸𝐹
vi. 𝐴 𝐵ഥ C + 𝐴 + 𝐵 + 𝐶 + 𝐴 𝐵ഥ 𝐶ഥ 𝐷
vii. 𝐴𝐵ത + 𝐶 𝐷
ഥ + 𝐸𝐹
Sum-of-Products
• A sum-of-products (SOP) expression is a boolean expression in a
specific format.
• The term sum-of-products comes from the expression’s form: a sum
(OR) of one or more products (AND).

Eg:
Product-of-Sums
• The Product-of-Sum is a form of Boolean algebra where various
sum(OR) terms are combined together through product(AND).

Eg:
Boolean Function
• Boolean functions can be represented using expressions made up from
variables and Boolean operations.

• Each Boolean expression represents a Boolean function. The values of


this function are obtained by substituting 0 and 1 for the variables in the
expression.

• Eg: 𝑓 𝑥, 𝑦 = 𝑥𝑦ത
Example:

The function 𝑓 𝑥, 𝑦 = 𝑥𝑦ത from the set of ordered pairs of


Boolean variables to the set {0, 1}
Exercise

Show that (1.1) + (1 + 0 + 0) = 1

Use a table to express the values of each of these Boolean Functions.


a) f x, y = 𝑥ഥ 𝑦
b) f x, y, z = 𝑥 + 𝑦. 𝑧
c) f x, y, z = 𝑥 𝑦ഥ + (𝑥 . 𝑦 . 𝑧)
d) f x, y, z = 𝑦ഥ (𝑥 𝑧 + 𝑥ഥ 𝑧ഥ )
Duality Principle
▪ According to the duality principle, one type of operation can be converted
into another type of operation.

▪ The dual of a Boolean expression can easily be obtained by interchanging


sums and products and interchanging 0 and 1.

Operator / Variable Dual of the operator

AND OR Sum converted to Product . → +


OR AND Product converted to Sum + → .
1 0

0 1
Duality Principles Examples

Expression Dual

1.0 = 0 0+1=1

1+0=1 0.1 = 0

A.0 = 0 A+1=1

A.A = 0 A+A=1

A.B = B.A A+B=B+A

A.(B.C) = (A.B).C A + (B + C) = (A + B) + C
Exercise

Find the duals of the following expressions.

i. 1+0=1
ii. A.1 = 0
iii. A.(A + B) = A
iv. AB + C + BCA = 0
v. A•B+C = A•B + A•C

You might also like