BOOLEAN LOGIC
DIGITAL SYSTEM AND CIRCUITS
• Digital circuits are electronics that handle digital signals.
• It deals with 2 states (high and low). Binary number 1 and 0
• Boolean logic and logic gates are fundamental components of how computers
process information at the most basic level.
• Binary Representation: Computers represent data and instructions using binary
digits (bits), which can be either 0 or 1. This binary system forms the basis of all
computer operations.
• Boolean Logic: Boolean logic is a branch of algebra where variables are either true or
false, represented by 1 or 0 in digital systems. It includes logical operations such as
AND, OR, NOT, and XOR.
• Logic Gates: They are electronic circuits designed to perform specific operations on
one or more binary inputs and produce a single binary output based on those inputs.
• Circuit Design: Digital circuits inside computers, such as CPUs, memory units, and
peripheral controllers, are designed using logic gates. These gates are interconnected
to perform arithmetic, logical, and control operations that are essential for
computing tasks.
• Microprocessors and ALU: Inside a microprocessor, an Arithmetic Logic Unit (ALU)
performs arithmetic (addition, subtraction, etc.) and logical operations (AND, OR,
etc.) using combinations of logic gates.
De-capped chip
DEVELOPMENT OF BOOLEN LOGIC
• George Boole: The Law of Thoughts
• Boolean Algebra also known as the SWITCHING ALGEBRA is the algebra
of logic that deals with the study of binary variables and logical
operations.
• It was founded by the mathematician George Boole in 1854
• Boole created a system by which certain logical statements can be
expressed in mathematical terms.
• This logic helps in developing digital electronics circuits.
• Computer system transmits high and low voltage which can be denoted
by true or false.
Binary Values (Quantities)
• In our daily life, we need to take logical decisions. Answers comes in
whether Yes(T) or No (F).
• Eg: Does the Sun rise in East?
• Do you like ice cream?
• The decisions which results in Yes or No only are known as binary decisions.
• Values T and F are known as truth values.
• Boolean variables can only be either T or F.
• Indira Gandhi is the only woman Prime Minister in India( the result is true –
T, so it is a logical statement).
• Can I have your opinion? (it can not be resulted in T or F. this is rhetorical
question). Therefore it is not a logical statement.
LOGICAL OPERATIONS
• The logical operations are of 3 types
• AND
• OR
• NOT
• Before proceeding further we will get to know some features of
logical statement. For Ex:
• Stmt 1: I want to have tea.
• Stmt 2: Tea is ready.
• Now lets develop a table for all the possible results.
• (X) I want to have tea T T F F
• (Y) Tea is ready T F T F
• (R) Result. I drink tea T F F F
• Now if we create the truth table,
Truth Table
• Truth Table is a table which contain all possible truth values of logical
values along with all possible results.
• When all the results of a Truth Table are true (1), this condition is
known as TAUTOLOGY and if all results are false (0) then this condition
is called FALLACY.
Logical Operator NOT
NOT operator is represented by applying (‘) or ( ) .
X’ or X. This is a unary operator which is also known as
complementation operator.
-0’ = 1 and 1’=0
Truth table and Venn Diagram for NOT operator.
AND
• AND operator is used by applying (.) between 2 variables like X.Y.
• It denotes logical multiplication.
• X.Y is read as X AND Y
• Rules of AND operation are
• 00=0
• 01=0
• 10=0
• 11=1
• Pink shadow shows X.Y--
OR
• OR operator is used by applying (+) between 2 variables like X+Y.
• It denotes logical addition.
• X+Y is read as X OR Y
• Rules of OR operation are
• 00=0
• 01=1
• 10=1
• 11=1
EVALUATION OF BOOLEAN
EXPRESSION USING TRUTH TABLES
• To develop Boolean Expression, logical variables along with logical
operators. Truth tables is used for it evaluation.
• X + (Y.X)’ + Z’ is a Boolean expression and the table should be as
follows
• Variables are X,Y,Z = 3 nos
• So 23=8
• 8/2=4
• 4/2=2
• 2/2=1
PRINCIPLES OF DUALITY: it states that starting with a
boolean relation, another relation can be derived.
AXIOMS :basic rule which needs no proof
2. Identity Element.
a) 1 for AND because
x•1=x
1 • x = x.
ie
X=0
0.1=0
X=1
1.1=1
b) 0 for OR because
x+0=x
0 + x = x.
3. Commutative Property.
From the symmetry of the tables.
a) x • y = y • x.
b) x + y = y + x. (prove using truth table)
4. Distributive Property.
c) x • (y + z) = (x • y) + (x • z).
d) x + (y • z) = (x + y) • (x + z). (prove using truth table)
5. Complement Element.
e) x + x' = 1
0 + 0' = 0 + 1 = 1
1 + 1' = 1 + 0 = 1
b) x • x' = 0
0 • 0' = 0 • 1 = 0
1 • 1' = 1 • 0 = 0
Basic Theorems
• Basic Theorems - need to be proven.
1. Indempotency.
• a) x + x = x.
Proof of 1a)
by Axiom 2a =x + x => (x + x) • 1
by Axiom 5a = (x + x) (x + x’)
by Axiom 4b = x + xx’
by Axiom 5b = x + 0 => x
• b) x• x = x.
2. a) x + 1 = 1.
b) x • 0 = 0.
3. Absorption.
a) yx + x = x
b) (y + x)x = x 4.
4. Involution.
c) (x')' = x
5. Associative.
d) (x + y) + z = x + (y + z)
e) b) x (y z) = (x y) z
• xy + xy'z + x'yz
De Morgan’s Theorem
• De Morgan’s First Law:
• De Morgan’s First Law states that (A.B)’ = A’+B’.
• The truth table that shows the verification of De
Morgan’s First law is given as follows:
• De Morgan’s Second Law:
• De Morgan’s Second law states that (A+B)’ = A’. B’.
NOR GATE
• It is the NOT of OR Gate
• Has two or more input signals but only one output signal
• If all the inputs are 0, the output is 1
• Otherwise the output is 0
• It is the Universal Gate
NAND GATE
• It is NOT of AND Gate.
• Has two or more input signals but only one output signal
• If all the inputs are 1, the output is 0
• Otherwise the output is 1
• It is also a Universal Gate
XOR GATE
• Exclusive OR gate
• Has two or more input signals but only one output signal
• Produces output 1 for only those input combinations that have odd
number of 1’s
XOR GATE
XNOR GATE
• Exclusive NOR gate
• Has two or more input signals but only one output signal
• In the XNOR gate, the output is in state 1 when both inputs are the
same, that is, both 0 or both 1.
XNOR GATE
