Boolean Logic
Introduction
Developed by English Mathematician
George Boole in between 1815 -
1864.
It is described as an algebra of logic
or an algebra of two values i.e True
or False.
The term logic means a statement
having binary decisions i.e True/Yes
or False/No.
Application of Boolean algebra
It is used to perform the logical operations
in digital computer.
In digital computer True is represented
by ‘1’ (high volt) and False is
represented by ‘0’ (low volt)
Logical operations are performed by logical
operators. The fundamental logical
operators are:
1. AND (conjunction)
2. OR (disjunction)
3. NOT (negation/complement)
AND operator
It performs logical multiplication and
denoted by (.) dot.
X Y X.Y
0 0 0
0 1 0
1 0 0
1 1 1
OR operator
It performs logical addition and
denoted by (+) plus.
X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1
NOT operator
It performs logical negation and
denoted by (-) bar. It operates on
single variable.
X X (means complement of x)
0 1
1 0
Truth Table
Truth table is a table that contains all
possible values of logical
variables/statements in a Boolean
expression.
No. of possible combination =
2n, where n=number of variables used in
a Boolean expression.
Truth Table
The truth table for the logical expression
XY + Z is as follows:
Decimal X Y Z XY XY+Z
0 0 0 0 0 0
1 0 0 1 0 1
2 0 1 0 0 0
3 0 1 1 0 1
4 1 0 0 0 0
5 1 0 1 0 1
6 1 1 0 1 1
7 1 1 1 1 1
Tautology & Fallacy
If the output of Booean expression is
always True or 1 is called Tautology.
If the output of Boolean expression is
always False or 0 is called Fallacy.
P P’ output (PVP’) output (PΛP’)
0 1 1 0
1 0 1 0
PVP’ is Tautology and PΛP’ is Fallacy
Exercise
1. Evaluate the following Boolean
expression using Truth Table.
(a) X’Y’+X’Y
(b) X’YZ’+XY’
(c) XY’(Z+YZ’)+Z’
2. Verify that P+(PQ)’ is a Tautology.
3. Verify that (X+Y)’=X’Y’
Implementation
Boolean Algebra applied in computers
electronic circuits. These circuits
perform Boolean operations and
these are called logic circuits or logic
gates.
Logic Gate
A gate is a digital circuit which operates on one or more signals and
produce single output.
Gates are digital circuits because the input and output signals are
denoted by either 1(high voltage) or 0(low voltage).
Logic gates are used to carry out the logical operations on single or
multiple binary inputs and result in one binary output.
The basic logic gates are categorized into seven types as AND, OR,
XOR, NAND, NOR, XNOR, and NOT. These are the important digital
devices, mainly based on the Boolean function.
The NAND and NOR gates are universal gates. A universal gate is a
gate which can implement any Boolean function without need to use
any other gate type.
AND gate
The AND gate is an electronic circuit that
gives a high output (1) only if all its inputs
are high.
AND gate takes two or more input signals
and produce only one output signal.
Input Input Output
A B AB
0 0 0
0 1 0
1 0 0
1 1 1
OR gate
The OR gate is an electronic circuit that
gives a high output (1) if one or more of its
inputs are high.
OR gate also takes two or more input
signals and produce only one output signal.
Input Input Output
A B A+B
0 0 0
0 1 1
1 0 1
1 1 1
NOT gate
The NOT gate is an electronic circuit that gives a
high output (1) if its input is low .
NOT gate takes only one input signal and produce
only one output signal.
The output of NOT gate is complement of its input.
It is also called inverter.
Input A Output A
0 1
1 0
XOR gate
“XOR” an abbreviation for “Exclusively-OR.” The simplest XOR
gate is a two-input digital circuit that outputs a logical “1” if
the two input values differ, i.e., its output is a logical “1” if either
of its inputs are 1, but not at the same time (exclusively).
NAND GATE
NAND is an abbreviation for “NOT AND.” A two-input NAND
gate is a digital combination logic circuit that performs the
logical inverse of an AND gate. While an AND gate outputs a
logical “1” only if both inputs are logical “1,” a NAND gate
outputs a logical “0” for this same combination of inputs.
NOR GATE
A NOR gate is a digital logic gate that gives an output of 0
when any of its inputs are 1, otherwise 1. NOR gates can be
made to produce a variety of logic gates, including OR and
AND gates. The output of the NOR gate is a logic 0 as long as
the input voltage is below the threshold
NOR GATE
The NOR gate is a digital logic gate that implements logical NOR - it
behaves according to the truth table to the right. A HIGH output (1)
results if both the inputs to the gate are LOW (0); if one or both input is
HIGH (1), a LOW output (0) results. NOR is the result of the negation
of the OR operator.
Implement AND and OR gate using NAND gate
Please Note: This slide content is for additional learning. Not required to learn for exam
Implement AND and OR gate using NOR
Please Note: This slide content is for additional learning. Not required to learn for exam
Boolean Function/Expression
and its Simplification
• A Boolean function is an algebraic expression
formed using the AND, OR, and NOT operators.
Example : f=XY’(Z+YZ’)+Z’
• There are many benefits to simplifying Boolean
functions before they are implemented in
hardware. A reduced number of gates decreases
considerably the cost of the hardware, reduces the
heat generated by the chip and, most importantly,
increases the speed.
Boolean Algebra
Simplification Table
• There are several Boolean Algebra laws, rules and theorems available
which provides us with a means of reducing any long or complex
expression or combinational logic circuit into a much smaller one with
the most common laws presented in the following Boolean algebra
simplification table.
Principle of Duality
In Boolean algebras the duality Principle
can be is obtained by interchanging AND
and OR operators and replacing 0's by 1's
and 1's by 0's. Compare the identities on
the left side with the identities on the
right.
Example
X.Y+Z' = (X+Y).Z'
X+1=1
X.0=0
DE MORGAN'S FIRST THEOREM
The complement of the union of two sets is equal to the intersection of
their complements and the complement of the intersection of two sets
is equal to the union of their complements
DE MORGAN'S SECOND THEOREM
Rules to Create Logic Circuit
Exercise
Q 1. State & Verify De Morgan's First law by
using truth table.
Q 2. State & Verify De Morgan's Second law
by using truth table.
Q 3. Draw a logic circuit diagram for the
following expression:
(i) ab+b’c+c’a’
(ii) (a+b).(a+b’).c
THANK YOU
