Lecture 6
Boolean
Algebra – Laws
and Rules
Boolean Algebra
Boolean Operations and Expressions
Variable
is a symbol used to represent a logical quantity
Eg : A, B
Literal
A variable can have a value 1 or 0 , A=0 ,B=1
is a variable or the complement of a variable
Complement
Eg : A , 𝐴ҧ ,B, C’
is the inverse of a variable. Indicated by an overbar
or a prime symbol
Eg : If A = 1, then 𝐴ҧ = 𝐴′ = 0
If A = 0 then A’= 𝐴ҧ = 1
Boolean Operations and Expressions
Boolean Addition Boolean Multiplication
Boolean Addition is equivalent to OR operation Boolean Multiplication is equivalent to AND operation
Sum Term Product Term
is a sum of literals. In Logic circuits, a is a product of literals. In Logic circuits, a
Sum Term is produced by OR operations with no Sum Term is produced by AND operations with no OR
AND operations involved. operations involved.
Simple Problems
Q1.
Q2.
Laws and Rules of Boolean Algebra
Laws of Boolean Algebra
Commutative Laws Distributive Law
Associative Laws
Commutative Commutative Law
Law of Addition of Multiplication
Associative Law Associative Law
of Addition of Multiplication
Laws and Rules of Boolean Algebra
Laws of Boolean Algebra
Commutative Laws
1. Commutative Law of Addition
2. Commutative Law of Multiplication
Laws and Rules of Boolean Algebra
Laws of Boolean Algebra
Associative Laws
1. Associative Law of Addition
2. Associative Law of Multiplication
Laws and Rules of Boolean Algebra
Laws of Boolean Algebra
Distributive Law
Factoring
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
There are 12 Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Truth Table Logic circuit Simplification
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Truth Table
Logic circuit Simplification
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Proofs of the Basic Rules
Truth Table
Logic circuit Simplification
De Morgan's Theorems
De Morgan’s First Theorem
Augustus De Morgan
De Morgan's Theorems
De Morgan’s Second Theorem
Simple Problems
Q1.
Q2.
Simple Problems
Q3.
Q4.
Simple Problems
Q5.
Simplification using Boolean Algebra
Many times in the application of Boolean algebra, we have to reduce a particular expression
into its simplest form or change its form to a more convenient form
A simplified Boolean expression uses the fewest gates possible to implement the given expression
Example 1
Applying distributive law to the second and third terms, we get
AB+AB =AB and BB = B, so the expression becomes
B+BC =B and so it gets further reduced to
AB+B =B as the final adjustment yields the result
Simplification using Boolean Algebra
Example 2
