University Of Sulaimani

College of Commerce
Department Of IT
1st Stage -A-

Boolean Algebra

Prepared by:
Zhiyar Nawzad Mohammed
Akar Star

Lecturer:
Didam Mahmud
What Is Boolean Algebra?
Boolean algebra is a division of mathematics that deals with operations on logical values
and incorporates binary variables. Boolean algebra traces its origins to an 1854 book by
mathematician George Boole.

The distinguishing factor of Boolean algebra is that it deals only with the study of binary
variables. Most commonly Boolean variables are presented with the possible values of 1
("true") or 0 ("false"). Variables can also have more complex interpretations, such as in set
theory. Boolean algebra is also known as binary algebra.

KEY TAKEAWAYS
 Boolean algebra is a branch of mathematics that deals with operations on logical values
with binary variables.
 The Boolean variables are represented as binary numbers to represent truths: 1 = true
and 0 = false.
 Elementary algebra deals with numerical operations whereas Boolean algebra deals
with logical operations.
 The primary modern use of Boolean algebra is in computer programming languages.
 In finance, Boolean algebra is used in binomial options pricing models, which helps
determine when an option should be exercised.

Boolean Algebra Operations

The basic operations of Boolean algebra are as follows:

 Conjunction or AND operation

 Disjunction or OR operation
 Negation or Not operation
Understanding Boolean Algebra
Boolean algebra is different from elementary algebra as the latter deals with numerical
operations and the former deals with logical operations. Elementary algebra is expressed
using basic mathematical functions, such as addition, subtraction, multiplication, and
division, whereas Boolean algebra deals with the conjunction, disjunction, and negation.

The concept of Boolean algebra was first introduced by George Boole in his book "The
Mathematical Analysis of Logic," and further expanded upon in his book "An Investigation
of the Laws of Thought." Since its concept has been detailed, Boolean algebra's primary use
has been in computer programming languages. Its mathematical purposes are used in set
theory and statistics.

Boolean Expression
A logical statement that results in a boolean value, either 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.
Boolean Algebra Truth Table
Now, if we express the above operations in a truth table, we get;

A B A∧B A∨B

True True True True

True False False True

False True False True

False False False False

A ¬A

True False

False True

There are six types of Boolean algebra laws:

 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
This law uses the NOT operation. 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 Demorgan’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 Demorgan 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 Demorgan’s First law is given as follows:

A B A’ B’ (A.B)’ A’+B’
 0 0 1 1 1 1

0 1 1 0 1 1

1 0 0 1 1 1

1 1 0 0 0 0

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

Hence, Demorgan’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.

A B A’ B’ (A+B)’ A’. B’

0 0 1 1 1 1

0 1 1 0 0 0

1 0 0 1 0 0

1 1 0 0 0 0

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

Hence, Demorgan’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.

What is meant by Boolean algebra?

In Mathematics, boolean algebra is called logical algebra consisting of binary variables that
hold the values 0 or 1, and logical operations.

Why do we use Boolean algebra?

In electrical and electronic circuits, boolean algebra is used to simplify and analyze the
logical or digital circuits.

What are the three main Boolean operators?

The three important boolean operators are:
AND (Conjunction)
OR (Disjunction)
NOT (Negation)

Laws and Theorems of Boolean Algebra

1a. X • 0 = 0 1b. X + 1 = 1 Annulment Law
2a. X • 1 = X 2b. X + 0 = X Identity Law
3a. X • X = X 3b. X + X = X Idempotent Law
Complement
4a. X • X = 0 4b. X + X = 1
Law
Double Negation
5. X =X
Law
Commutative
6a. X • Y = Y • X 6b. X + Y = Y + X
Law
7a. X (Y Z) = (X Y) Z = (X Z) Y = X Y Z Associative Law
X + (Y + Z) = (X + Y) + Z = (X + Z) + Y = X +
7b. Associative Law
Y+Z
X • (Y + Z) = X Y + X + Y Z = (X + Y) •
8a. 8b. Distributive Law
XZ (X + Z)
de Morgan's
9a. X • Y = X + Y 9b. X + Y = X • Y
Theorem
10a. X • (X + Y) = X 10b. X + X Y = X Absorption Law
(X + Y) • (X + Y) =
11a. 11b. X Y + X Y = X Redundancy Law
X
12a. (X + Y) • Y = XY 12b. X Y + Y = X + Y Redundancy Law
13a. (X + Y) • (X + Z) • (Y + Z) = (X + Y) • (X + Z) Consensus Law
13b. X Y + X Z + Y Z = X Y + X Z Consensus Law
X ⊕ Y = (X + Y) • X⊕Y=XY+
14a. 14b. XOR Gate
(X + Y) XY
X ⊙ Y = (X + Y) • X⊙Y=XY+X
15a. 15b. XNOR Gate
(X • Y) Y
15c. X ⊙ Y = (X + Y) • (X + Y) XNOR Gate

Gates

Standard DeMorgan's
NA
X=A•B X=A+B
ND

AN
X=A•B X=A+B
D

NO X=A+B
X=A•B
R

OR X=A+B X=A•B

References:
https://www.investopedia.com/terms/b/boolean-algebra.asp

https://www.mi.mun.ca/users/cchaulk/misc/boolean.htm

https://ryanstutorials.net/boolean-algebra-tutorial/boolean-algebra.php

https://circuitcellar.com/resources/quickbits/boolean-algebra/

https://byjus.com/maths/boolean-algebra/#:~:text=Boolean%20algebra%20is%20the
%20category,Binary%20Algebra%20or%20logical%20Algebra.

END

Thanks for your time!