0% found this document useful (0 votes)
17 views14 pages

Boolean algebra

Notes on Boolean Algebra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views14 pages

Boolean algebra

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

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. It is used to analyze and simplify digital circuits or
digital gates. It is also called Binary Algebra or logical Algebra. It has been fundamental in the
development of digital electronics and is provided for in all modern programming languages. It is
also used in set theory and statistics.

The important operations performed in Boolean algebra are – conjunction (∧), disjunction (∨) and
negation (¬). Hence, this algebra is far way different from elementary algebra where the values of
variables are numerical and arithmetic operations like addition, subtraction is been performed on
them.

Boolean Algebra Operations


The basic operations of Boolean algebra are as follows:

Conjunction or AND operation


Disjunction or OR operation
Negation or Not operation

Below is the table defining the symbols for all three basic operations.

Suppose A and B are two Boolean variables, then we can define the three
operations as;

 A conjunction B or A AND B, satisfies A ∧ B = True, if A = B = True or else A ∧ B =

A disjunction B or A OR B, satisfies A ∨ B = False, if A = B = False, else A ∨ B = True.


False.

 Negation A or ¬A satisfies ¬A = False, if A = True and ¬A = True if A = False

Boolean Expression
A logical statement that results in a Boolean value, either be True or False, is a
Boolean expression. Sometimes, synonyms are used to express the statement such
as ‘Yes’ for ‘True’ and ‘No’ for ‘False’. Also, 1 and 0 are used for digital circuits for
True and False, respectively.
Boolean expressions are the statements that use logical operators, i.e., AND, OR,
XOR and NOT. Thus, if we write X AND Y = True, then it is a Boolean expression.

Boolean Algebra Terminologies


Now, let us discuss the important terminologies covered in Boolean algebra.
Boolean Algebra: Boolean algebra is the branch of algebra that deals with logical
operations and binary variables.
Boolean Variables: A Boolean variable is defined as a variable or a symbol defined
as a variable or a symbol, generally an alphabet that represents the logical quantities
such as 0 or 1.
Boolean Function: A Boolean function consists of binary variables, logical
operators, constants such as 0 and 1, equal to the operator, and the parenthesis
symbols.
Literal: A literal may be a variable or a complement of a variable.
Complement: The complement is defined as the inverse of a variable, which is
represented by a bar over the variable.
Truth Table: The truth table is a table that gives all the possible values of logical
variables and the combination of the variables. It is possible to convert the Boolean
equation into a truth table. The number of rows in the truth table should be equal to
2n, where “n” is the number of variables in the equation. For example, if a Boolean
equation consists of 3 variables, then the number of rows in the truth table is 8. (i.e.,)
23 = 8.

Boolean Algebra Truth Table


Now, if we express the above operations in a truth table, we get;

Boolean Algebra Rules


Following are the important rules used in Boolean algebra.

Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.
The complement of a variable is represented by an overbar.
OR-ing of the variables is represented by a plus (+) sign between them. For example, the OR-ing of A,
B, and C is represented as A + B + C.
Logical AND-ing of the two or more variables is represented by writing a dot between them, such as
A.B.C. Sometimes, the dot may be omitted like ABC.
Laws of Boolean Algebra
There are six types of Boolean algebra laws. They are:

Commutative law
Associative law
Distributive law
AND law
OR law
Inversion law
Those six laws are explained in detail here.

Commutative Law
Any binary operation which satisfies the following expression is referred to as a commutative
operation. Commutative law states that changing the sequence of the variables does not have any
effect on the output of a logic circuit.

A. B = B. A
A+B=B+A
Associative Law
It states that the order in which the logic operations are performed is irrelevant as their effect is the
same.

( A. B ). C = A . ( B . C )
( A + B ) + C = A + ( B + C)
Distributive Law
Distributive law states the following conditions:

A. ( B + C) = (A. B) + (A. C)
A + (B. C) = (A + B) . ( A + C)
AND Law
These laws use the AND operation. Therefore they are called AND laws.

A .0 = 0
A.1=A
A. A = A

OR Law
These laws use the OR operation. Therefore they are called OR laws.

A +0=A
A+1=1
A+A=A

Inversion Law
In Boolean algebra, the inversion law states that double inversion of variable results in the original
variable itself.
Boolean Algebra Theorems
The two important theorems which are extremely used in Boolean algebra are De Morgan’s First law
and De Morgan’s second law. These two theorems are used to change the Boolean expression. This
theorem basically helps to reduce the given Boolean expression in the simplified form. These two De
Morgan’s laws are used to change the expression from one form to another form. Now, let us
discuss these two theorems in detail.

De Morgan’s First Law:

De Morgan’s First Law states that (A.B)’ = A’+B’.

The first law states that the complement of the product of the variables is equal to the sum of their
individual complements of a variable.

The truth table that shows the verification of De Morgan’s First law is given as follows:

The last two columns show that (A.B)’ = A’+B’.

Hence, De Morgan’s First Law is proved.

De Morgan’s Second Law:

De Morgan’s Second law states that (A+B)’ = A’. B’.

The second law states that the complement of the sum of variables is equal to the product of their
individual complements of a variable.

The following truth table shows the proof for De Morgan’s second law.
The last two columns show that (A+B)’ = A’. B’.

Hence, De Morgan’s second law is proved.

The other theorems in Boolean algebra are complementary theorem, duality theorem, transposition
theorem, redundancy theorem and so on. All these theorems are used to simplify the given Boolean
expression. The reduced Boolean expression should be equivalent to the given Boolean expression.

Solved Examples
Question: Simplify the following expression:

Solution:

Given:

According to Demorgan’s law, we can write the above expressions as

From Commutative law:

From Complement law

Therefore,

Question 2: Draw a truth table for A(B+D).


Solution: Given expression A(B+D).

Boolean algebra is a branch of mathematics that deals with the manipulation of variables which can
assume only two truth values, true or false, denoted by 1 and 0, respectively.

Boolean algebra is named after English mathematician George Boole, who first introduced this
concept in his book, “The Mathematical Analysis of Logic”. The idea of Boolean algebra became the
basis of digital electronics and provided essential logic systems for modern computer programming
languages. Unlike general variables, Boolean variables can either have the values 1 or 0, which
denotes the state of ON and OFF in digital electronics. The primary operations which are performed
over these variables are addition and multiplication. Let us learn the Boolean algebra laws and
theorems to perform the arithmetic operations over Boolean variables.

Operations in Boolean Algebra

Before understanding the laws of Boolean algebra, let us quickly go through the various logic
operations and their truth values used in Boolean algebra for calculation.

The basic logic operations are


What are Boolean Algebra Laws?

Boolean algebra laws and theorems are a set of rules that are required to reduce or simplify any
given complex Boolean expression. Follwing is a list of Boolean algebra laws that are most commonly
used.
In addition to these Boolean algebra laws, we have a few Boolean postulates which are used to
algebraically solve Boolean expressions into a simplified form.
Application of Boolean Algebra Laws

As we have already stated laws of Boolean algebra have their application in digital electronics. Let us
see how these laws are used in switching circuits.
Solved Examples on Boolean Algebra Laws
Now, let us apply these Boolean laws to simplify complex Boolean expressions and
find an equivalent reduced Boolean expression.

Example 1:

Simplify the following Boolean expression: (A + B).(A + C).

Solution:

Let us simplify the given Boolean expression (A + B).(A + C) using relevant Boolean
laws.

Thus, (A + B).(A + C) = A + BC

Example 2:

Simplify the following Boolean expression: (X + Y).(Xc + Y).

Solution:

Given Boolean expression, (X + Y).(Xc + Y)


Thus, the simplified Boolean expression is (X + Y).(Xc + Y) = Y.

Practice Problems on Boolean Algebra Laws


Prove the absorption laws of Boolean algebra.
Simplify the following Boolean expression: p’q’r + p’qr + pq’
Simplify the following Boolean expression: AB + A’C +BC

De Morgan’s law states that ‘The complement of the union of two sets A and B is
equal to the intersection of the complement of the sets A’ and B’. Also, according to
De Morgan’s law, the complement of the intersection of two sets A and B is equal to
the union of the complement of the sets A and B i.e.,

(A∪B)’ = A’ ∩ B’

And (A ∩ B)’ = A’ ∪ B’

What is the complement of a Set?


The complement of a set is defined as

A’ = {x : x ∈ U and x ∉ A}

where A’ denotes the complement.

Complement of Sets Properties


i) Complement Laws: The union of a set A and its complement A’ gives the universal
set U of which, A and A’ are a subset.

A ∪ A’ = U

Also, the intersection of a set A and its complement A’ gives the empty set ∅.
A ∩ A’ = ∅

For Example: If U = {1 , 2 , 3 , 4 , 5 } and A = {1 , 2 , 3 } then A’ = {4 , 5}. From this it


can be seen that

A ∪ A’ = U = { 1 , 2 , 3 , 4 , 5}

Also

A ∩ A’ = ∅

ii) Law of Double Complementation: According to this law if we take the complement
of the complemented set A’ then, we get the set A itself.

(A’)’ = A

In the previous example we can see that, if U = {1 , 2 , 3 , 4 , 5} and A = {1 , 2 ,3}


then A’ ={4 , 5}. Now if we take the complement of set ‘A’ we get,

(A’)’ = {1 , 2 , 3} = A

This gives back the set A itself.

iii) Law of empty set and universal set:

According to this law the complement of the universal set gives us the empty set and
vice-versa i.e.,

∅’ = U And U’ = ∅

This law is self-explanatory.

To understand this law better let us consider the following example:

Solved Problem
Example:

A universal set U which consists of all the natural numbers which are multiples of 3,
less than or equal to 20. Let A be a subset of U which consists of all the even
numbers and the set B is also a subset of U consisting of all the prime numbers.
Verify De Morgan Law.

Solution: We have to verify (A ∪ B)’ = A’ ∩ B’ and (A ∩ B)’ = A’∪B’. Given that,

U = {3 , 6 , 9 , 12 , 15 , 18}

A = {6 , 12 , 18}

B = {3}
The union of both A and B can be given as,

A ∪ B = {3 , 6 , 12 , 18}

The complement of this union is given by,

(A ∪ B)’={9 , 15}

Also, the intersection and its complement are given by:

A∩B=∅

(A ∩ B)’ = {3 , 6 , 9 , 12 , 15 ,18}

Now, the complement of the sets A and B can be given as:

A’ = {3 , 9 , 15}

B’ = {6 , 9 , 12 , 15 , 18}

Taking the union of both these sets, we get,

A’∪B’ = {3 , 6 , 9 , 12 , 15 ,18}

And the intersection of the complemented sets is given as,

A’ ∩ B’ = {9 , 15}

We can see that:

(A ∪ B)’ = A’ ∩ B’ = {9 , 15}

And also,

(A ∩ B)’ = A’ ∪ B’ = {3 , 6 , 9 , 12 , 15 ,18}

Hence, the above result is true in general and is known as De Morgan Law.

You might also like