Boolean Logic

Boolean Algebra
Boolean algebra, also known as “the algebra of logic” and was developed by an English
mathematician George Boole. The original purpose of this algebra was to solve logic Problems.
Definition:
The algebra which deals with only two quantities that is either true or false is called Boolean
algebra. It is also called as propositional algebra/switching algebra/two state algebra.
Binary Decision
A logic which results in either true or false.
Logical Statements / Truth functions
The Statements, which can be determined to be TRUE or FALSE are called logical statements or
truth functions.
Truth values / Logical constants
The Truth Values of a logical statement are known as Logical Constants. Truth values are
depicted by logical constants TRUE (1) and FALSE (0).
Logical variables / Binary valued variables
The variables which can store these truth values are called Logical Variables or Boolean
variable. or Binary Valued Variables as these can store one of the two values TRUE or FALSE.
Eg. 13-11=2 is always TRUE and Delhi is the largest state in India is always FALSE.
Truth Table
Truth Table is a table, which represents all the possible Truth values of logical
variables/statements along with all the possible results of the Boolean expression they are
making. To construct truth table of n logical variables, the truth table will have 2n rows where
each row will represent a combination of values of each variable where n = total no. of logical
variables.
For eg. to construct the truth table of two variables X & Y, we’ll have 22 = 4 rows.
So, all possible truth values of 2 variables will be:
X Y
0 0
0 1
1 0
1 1
Similarly, truth values of three variables will have 8 combinations i.e 23=8:
X Y Z
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Logical Operator
Boolean algebra contains 3 basic logical operators –
• NOT
• OR
• AND
NOT :operator is an unary operates which operates on a single logical variable. The operation
performed by NOT operator is called complementation and the symbol we use for NOT is _(bar)
or ‘ . Thus means complement of X and NOT operation negates the statement i.e if a statement
X is TRUE is FALSE and vice versa.
Example: F : I will go out today. F’ : I will not go out today.

TRUTH TABLE FOR NOT

OR operator (+)
A second important operator in boolean algebra is OR operator which denotes operation called
logical addition and the symbol we use for it is +. The final outcome is true only if any one of the
input is true. The symbol therefore, does not have the 'normal' meaning, but is a logical addition
or logical OR symbol. Thus X+Y can be read as X OR Y. For OR operation the possible input
and output combinations are as follows :
0+0=0
0+1=1
 1+0=1
1+1=1
Example: (100>90) OR( 100<100 ) .As one condition is true the outcome is True.

AND Operator (.)

AND Operator is another binary operator which performs logical multiplication. The outcome is
only true when all the inputs are true. The symbol for AND operation used is (.) dot. Thus X.Y
will be read as X and Y. The rules for AND operation are :
0.0=0
0.1=0
1.0=0
1.1=1
Example: (100>90) AND ( 100<100 ) .As one condition is true and one is false the outcome is
false. Both the condition should be true

Boolean Literals :
A Boolean variable is denoted by alphabets A-Z and a-z. A Boolean variable in direct or
complemented form present in an expression is called a literal.
Compound Statements / Logical functions
Logical statements which are combined with the help of logical operators.
• Tautologies: The compound logical statements which are always true.
• Fallacies :The compound logical statements which are always false.
Evaluation of a boolean expression using truth table
• Logical variable combined by the means of logical operators ( AND, OR, NOT ) forms a
Boolean expression. To study a Boolean expression,
• First construct a truth table denoting all possible combination of truth values for the
variables
• Then evaluate the expression for each of the possible combinations of variables in turn.
To make a truth Table of a Boolean expression, the rules are:
1. No. of combinations is equal to 2n where n is the No. of variables used in the Boolean
expression.
2. While evaluating a Boolean expression precedence order of operators should be followed first
NOT then AND then OR.
3. If there is any parenthesis then the expression in the parenthesis is evaluated first.
Evaluation of Boolean Expression using truth table

De Morgan's Theorem
 De Morgan's first Theorem (X+Y)' = X’Y’
 De Morgan's second Theorem (XY)' = X'+ Y’
Exercise
1. Draw the equivalent logic circuit for the following Boolean
expression:
(A.B)+C
2. Draw a Logical Circuit Diagram for the following Boolean Expression
X’. (Y’ + Z)
3. Verify the following using Truth Table.
U. (U' +V) = (U + V)
4. Verify X’Y + X.Y’ + X’.Y’ = (X’+Y’) using truth table.
5. Draw the Logic Circuit of t he following Boolean Expression:
(X’ + Y) . Z + W’
6. State and verify De Morgan’s law in Boolean Algebra using truth
table.
7. Write the equivalent Boolean Expression for the following logic
Circuit.

8. Obtain the Boolean Expression for the logic circuit shown below: