BOOLEAN ALGEBRA

AP 2 (DIGITAL LOGIC DESIGN)

GROUP 1 (BSIT-IA)
BOOLEAN ALGEBRA
• Branch of mathematics that deals with operations on logical
values with binary variables.
• George Boole (1815 – 1864)
§ Simplifying representation
§ Manipulation of propositional logic
• Claude E. Shannon
§ Design of relay switching circuits
• Used in designing electronic circuits used in computers
• Provides straightforward approach
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
ANNULMENT / NULL LAW
AND GATE OR GATE
A B OUTPUT A B OUTPUT
0 0 0 0 0 0
0 1 0 A∧0=0 AV1=1 0 1 1
1 0 0 1 0 1
1 1 1 A0 = 0 A+1=1 1 1 1
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
IDENTITY LAW
AND GATE OR GATE
A B OUTPUT A B OUTPUT

0
0
0
1
0
0
1A = A 0+A=A 0
0
0
1
0
1
1 0 0 1∧A=A 0VA=A 1
1
0
1
1
1
1 1 1
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
IDEMPOTENT LAW
AND GATE OR GATE
A B OUTPUT A B OUTPUT
0 0 0
A∧A=A AVA=A 0 0 0
0 1 0 0 1 1
1 0 0 AA = A A+A=A 1 0 1
1 1 1 1 1 1
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
INVERSE / COMPLEMENT LAW
AND GATE OR GATE
A B OUTPUT A B OUTPUT
0 0 0
A=0 A+=1 0 0 0
0 1 0 0 1 1
1 0 0
A∧ =0 AV =1 1 0 1
1 1 1 1 1 1
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA

DOUBLE NEGATION LAW

´𝐴=A
POSTULATES/LAWS OF
BOOLEAN ALGEBRA
ASSOCIATIVE LAW
AND GATE

(AB)C = A(BC)
OR GATE

(A+B)+C = A+(B+C)
POSTULATES/LAWS OF
BOOLEAN ALGEBRA
COMMUTATIVE LAW
AND GATE

AB = BA
OR GATE

A+B = B+A
POSTULATES/LAWS OF
BOOLEAN ALGEBRA
DISTRIBUTIVE LAW
AND GATE

A(B+C) = (AB)+(AC)
OR GATE

A+(BC) = (A+B)(A+C)
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
ABSORPTIVE / ABSORPTION LAW

AND GATE OR GATE

A(A+B) = A A+(AB) = A
 C=A((A++)
LAWS AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A

EXAMPLES
 D=AB+BC(B+C)
LAWS AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A

EXAMPLES
 LAWS
M=A+AB AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A

EXAMPLES
 Z=(B)+(B)+(BC)
LAWS AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A

EXAMPLES
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
DE MORGAN’S LAW
AND GATE

1. Change AND operator to an OR operator.

2. NOT the terms on the either side of operator.
3. NOT everything that has changed.
4. Remove double negation.
 POSTULATES/LAWS OF
BOOLEAN ALGEBRA
DE MORGAN’S LAW
OR GATE

¬(A+B)
1. Change OR operator to an AND operator.
2. NOT the terms on the either side of operator.
3. NOT everything that has changed.
4. Remove double negation.
 Z=¬(¬A+¬(BA))
LAWS AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A
DE MORGAN’S ¬(AB) = ¬(A+B) =

EXAMPLES
 Z=¬(AB)(¬A+B)(¬B+B)
LAWS AND GATE OR GATE
NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
IDEMPOTENT AA = A A+A=A
INVERSE / COMPLEMENT A=0 A+= 1
DOUBLE NEGATION =A
ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)
COMMUTATIVE AB = BA A+B = B+A
DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)
ABSORPTION/ABSORPTIVE A(A+B) = A A+(AB) = A
DE MORGAN’S ¬(AB) = ¬(A+B) =

EXAMPLES
SIMPLIFY THE FOLLOWING EXPRESSIONS:
1. O=AB+A(B + C) + B(B ∨ C)
LAWS AND GATE OR GATE
2. Z=A+(B) NULL / ANNULMENT A0 = 0 A +1 = 1
IDENTITY 1A = A 0+A=A
3. P=¬(¬(¬A+B)A) IDEMPOTENT AA = A A+A=A
INVERSE /

4. H=¬(¬A(B+C)) COMPLEMENT A=0 A+= 1

DOUBLE NEGATION =A

5. R=AB+A ASSOCIATIVE (AB)C = A(BC) (A+B)+C = A+(B+C)

COMMUTATIVE AB = BA A+B = B+A

DISTRIBUTIVE A(B+C) = (AB)+(AC) A+(BC) = (A+B)

(A+C)
ABSORPTION/
A(A+B) = A A+(AB) = A

QUIZ
ABSORPTIVE
DE MORGAN’S ¬(AB) = ¬(A+B) =
Title and Content Layout with
SmartArt

Step 1 Title Step 2 Title Step 3 Title Step 4 Title

Task description Task description Task description Task description

Task description Task description Task description Task description

Task description Task description

Task description
Add a Slide Title - 2
Add a Slide Title - 3
Add a Slide
Title - 4
Click icon to add picture

Add a Slide
Title - 5