Scribd
Upload
41 views7 pages

Boolean Algebra 1

Boolean algebra is a branch of algebra that uses binary variables that can take true or false values. Boolean expressions use logical operators like AND, OR, and NOT. Truth tables list all combinations of variable values and the resulting output. Boolean algebra rules and laws like commutativity, associativity, distributivity, De Morgan's laws allow simplifying and transforming boolean expressions.

Uploaded by

Prime Mfune
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views7 pages

Boolean Algebra 1

Boolean algebra is a branch of algebra that uses binary variables that can take true or false values. Boolean expressions use logical operators like AND, OR, and NOT. Truth tables list all combinations of variable values and the resulting output. Boolean algebra rules and laws like commutativity, associativity, distributivity, De Morgan's laws allow simplifying and transforming boolean expressions.

Uploaded by

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

BOOLEAN ALGEBRA

BIT102-Computer Mathematics

Lecturer: Mr. Saviour Chibeti

January 31, 2023

1
1 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
1.1 Boolean Operations and Expressions

1.1.1 Boolean Terminologies


Denition 1.1.2. A binary variable that can take one or two possible values is called a boolean.
Since a boolean can take two values, we can say it is either true or false, yes or no, on or
o.
Denition 1.1.3. Any symbol that can be used to represent a logical quantity is called a variable.
Any single variable can have a 1 or a 0.
Denition 1.1.4. A branch of algebra in which the variable's values are the true values and
false values, ordinarily denoted 1 and 0 is called boolean algebra.
Denition 1.1.5. A boolean function consists of binary variables, logic operators, constants
such that 0 and 1, equals to the operator, and the parenthesis symbols.
In computer operation with binary values, Boolean logic can be used to describe electro-
magnetically charged memory locations or circuits that are either charged (1 or True) or not
charged (0 or False). The computer can use AND gate or an OR gate operation to obtain a
result that can be used to further processing.
Denition 1.1.6. Let A be a variable. Then the complement of A is the opposite of A and it
is denoted by Ā or A′ or Ac
Example 1.1.7. If A = 0, then Ā = 1
We dene a literal simply as a variable or a complement of a variable.

2
1.1.8 Boolean Algebra operations
Here we sail through the basic operations of Boolean algebra, we relate with some concept from
set theory.
(i) Conjunction or AND operation ∧

Let A and B be two sets. Then

Figure 1: A conjunction B

(ii) Disconjunction or OR operation ∨

Let A and B be two sets. Then

Figure 2: A disconjunction B

(iii) Negation or NOT operation

Let A be a set. Then

3
Figure 3: Negation of A

The above dened operations are the basic and most important operations performed in Boolean
algebra. Hence, we will see that this algebra is far away from elementary algebra algebra where
the values of variables are numerical and arithmetic operations.

We now present a table dening the symbols for all three basic operations discussed earlier.

Operator Symbol Precedence


NOT ′
(or) ¬ Highest
AND · (or) ∧ Middle
OR + (or) ∨ Lowest
Example 1.1.9. Suppose that A and B are two Boolean variables, then the following operations
hold.
(i) A Conjunction B or A and B satises A ∧ B =True, if both A and B are True else
A ∧ B =False.

(ii) A disconjunction B or A or B satises A ∨ B =False if both A and B are False, that is


A = B = False else A ∨ B = True

(iii) Negation A or NOT A satises ¬A = False, if A is True and ¬A =True, if A is False.

1.1.10 Boolean Expression and Truth Tables


Denition 1.1.11. A boolean expression is a logical statement that results in a boolean value,
either be True or False.
Sometimes we can use the statement 'Yes' for True and 'No' for False. For digital circuits,
1 and 0 are used for True and False respectively.
Boolean expressions are are the statement that use logical operators, i.e AND ∧, OR ∨ and
NOT ¬. Therefore, if we write X AND Y = True, then it is a boolean expression.
Denition 1.1.12. A table that gives all possible values of logical variables and the combination
of the variables is called a truth table.

4
It is very much possible to convert the boolean equation into a truth table.
Corollary 1.1.13. Let R be the number of rows in the truth table. Then R = 2n , where n is
the number of variables in the equation.
Example 1.1.14. If a boolean equation consists of 4 variables, How many number of rows will
its truth table have?
Solution
By the Corollary 1.1.13, we have that the number of rows, R is given by 2n , where n is the
number of variables. Now since n = 4, the number of rows is

R = 2n
= 24
= 16

Therefore the number of rows in the truth table is 16


In the previous section, we discussed about Boolean operations. Now supposed that A and
B are variables, then we can express boolean operations in a truth table as given below
A B A∧B A∨B
True True True True
True False False True
False True False True
False False False False
For the negation, we have
A ¬A
True False
False True

1.1.15 Boolean Algebra rules and Laws


We begin by rst discussing the most important rules used in Boolean algebra.
(i) Variables used can have only two values, Binary 1 for HIGH and Binary 0 for LOW.
(ii) The complement of a variable is represented by an over bar. Thus the complement of a
variable B is represented as B̄ . Thus is B = 0, then B̄ = 1.
(iii) OR−ing of the variables is represented by + sign between them.
Example 1.1.16. Suppose that we have OR-ing A, B and C , nd its representation.
Solution
The OR-ing of A, B, C is represented as

A+B+C

5
(iv) Logical AND-ing of the two or more variables is represented by writing a dot · between
then such as A · B · C . In other literature's, they omit the dot and write ABC .
We now discuss the six types of Boolean algebra laws.
(i) Commutativity

Let A and B be two variables. Then


A·B =B·A
A+B =B+A

The law states that changing the sequence of the variables does not have any eect on
the output of a logic circuit.
(ii) Associativity

Let A, B and C be variables. Then


(A · B) · C = A · (B · C)

(A + B) + C = A + (B + C)

(iii) Distributivity

Let A, B and C be variables. Then


A · (B + C) = (A · B) + (A · C)

A + (B · C) = (A + B) · (A + C)

(iv) AND Law

The following laws use the AND operation and they are therefore said to be AND laws.
If A is a variable, then
(1) A·0=0
(2) A·1=A
(3) A·A=A
(4) A · Ā = 0

(v) OR Law

OR laws are laws that uses the OR operation. Suppose that A is a variable, then
(1) A + 0 = A
(2) A + 1 = 1
(3) A + A = A

6
(4) A + Ā = 1
(6) Inversion Law

The inversion law uses the NOT operation. This law states that double inversion of
a variable results in the original variables itself. That is
Ā¯ = A

1.1.17 Boolean Algebra Theorems


We now discuss the two most important theorems that are used in Boolean algebra. These two
theorems are De Morgans First law and De Morgans Second law. These two theorems are used
to simplify and change boolean expressions.
(i) De Morgans First law

Let A and B be two variables. Then


A · B = Ā + B̄

The complement of two or more ANDed variables is equivalent to OR of the complements


of the individual variables.
(ii) De Morgans Second law

Let A and B be two variables. Then


A + B = Ā · B̄

The complement of two or more ORed variables is equivalent to AND of the complements
of the individual variables.
Example 1.1.18. Prove De Morgans First law using the truth table.
Proof
By De Morgans First Law, we have that if A and B are variables then

A · B = Ā + B̄

By employing the truth table, we have


A B Ā B̄ A · B Ā + 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

You might also like