BOOLEAN

ALGEBRA
PREPARED BY: ENGR. FRANCE MAE D.
CAMOGAO
Lesson Objective:

By the end of this lesson, students will understand

the fundamental concepts of Boolean algebra,
including basic operations, laws, and applications,
and be able to perform basic Boolean algebraic
manipulations.
Boolean Algebra
● Is the mathematical foundation of binary code and digital circuits
● A branch of algebra that deals with binary variables and logic
operations.
 Binary Code
Binary code is the foundation of digital communication, data storage,
and computation.
 George Boole
• Self-taught English Mathematician, philosopher,
and logician.
• Freeing algebra from arithmetic, he used
algebraic symbols to represent logical statements,
and established an algebra of symbols which can
be added or multiplied.
• He develop modern symbolic logic and whose
algebra of logic in the mid-19th century, now

called Boolean algebra.

The 3 Fundamental
Boolean operations
FUNDAMENTAL
OPERATIONS

● OR
● AND
● NOT
FUNDAMENTAL
OPERATIONS

● OR (Addition)
● AND
● NOT
FUNDAMENTAL
OPERATIONS

● OR (Addition)
● AND (Multiplication)
● NOT
FUNDAMENTAL
OPERATIONS

● OR (Addition)
● AND (Multiplication)
● NOT (Negates or Invert)
AND operation
The result is true if and only if
both inputs are true.
OR operation
The result is true if at least one
input is true.
NOT operation
Negates the input value; true
becomes false, and false
becomes true.
BOOLEAN LAW
AND THEOREMS
Boolean laws and theorems
provide a set of rules and
properties that help simplify
and manipulate Boolean
expressions.
 Identity
Laws
● Identity Law for AND: A AND 1 = A
● Identity Law for OR: A OR 0 = A
Domination Laws
● Domination Law for AND: A AND 0 = 0
● Domination Law for OR: A OR 1 = 1
Complement Laws
● Complement Law for AND: A AND ~A =
0
● Complement Law for OR: A OR ~A = 1
Idempotent Laws
● Idempotent Law for AND: A AND A = A
● Idempotent Law for OR: A OR A = A
Commutative Laws
● Commutative Law for AND: A AND B = B AND
A
● Commutative Law for OR: A OR B = B OR A
Associative Laws
● Associative Law for AND: (A AND B) AND C = A AND (B
AND C)
● Associative Law for OR: (A OR B) OR C = A OR (B OR C)
 Distributive Laws
● Distributive Law for AND over OR: A AND (B OR C) = (A AND B) OR (A
AND C)
● Distributive Law for OR over AND: A OR (B AND C) = (A OR B) AND (A
OR C)
De Morgan’s Laws
● De Morgan's Law for AND: ~(A AND B) = ~A OR
~B
● De Morgan's Law for OR: ~(A OR B) = ~A AND
~B
Absorption Laws
● Absorption Law for AND: A AND (A OR B) = A
● Absorption Law for OR: A OR (A AND B) = A
Double Negation
Laws
● ~~A = A
Redundancy Laws
● Redundancy Law for AND: A AND A = A
● Redundancy Law for OR: A OR A = A
TAKE NOTE:
● ALL DIGITAL DEVICES OPERATES ON THE PRINCIPLE OF BOOLEAN
ALGEBRA
SOLVING EXAMPLE:

● Simplify: (A ∧ B) ∨ (A ∧ ¬B)
● Express the following in terms of AND, OR, and NOT: ¬(A ∧ B)
● Use Boolean algebra to simplify: A ∨ (A ∧ B)
 SOLVING EXAMPLE:
(Logic Gates, Truth Table, and Boolean Algebra)
QUIZ