Boolean

Logic
 Introduction to Boolean Logic
Logic is the science of reasoning. It helps in making decisions based on true or false (yes or no).
Computers work using only two states: ON (1) and OFF (0) -> This is binary logic.
George Boole: The father of Boolean Logic (1815-1864):
He was a British Mathematician. In 1854, he wrote a book “An Investigation of the Laws of
Thought”.
He introduced a new kind of mathematics using:
1. Variables that take only two values: 1 (True), 0 (False).
2. Operations like: AND, OR, and NOT. This is known as Boolean Algebra.
In 1938, Claude E. Shannon applied Boolean logic to solve logic problems and published it in
paper titled, “ A Symbolic Analysis of Relay Switching Circuits”. As logic problems are binary
decisions and Boolean logic effectively deals with these binary values. This is called Switching
Algebra.
 What is Boolean Logic?
Boolean logic is a system of algebra used to perform operations on binary values ( 0 and 1).
Computers use Boolean logic to make decisions and perform calculations.
Every computer circuit is built using logic gates (AND, OR, NOT).
Boolean logic is the foundation of:
1. Digital Circuits
2. Programming
3. Databases (eg: Search Filters).
Boolean logic is not just a theory – it is used every where in the digital world.
 Applications of
Application Area How it is used
Boolean
LogicLogic
Digital Electronics
gates in circuit
Programming Conditional Statements
Search Engines Filtering results using AND, OR, Not
Control Systems Automatic decision making in machines (Phone,
Remote control etc)
CPU & Calculators Logical operations in ALU
Database Filtering Querying data using conditions
 Binary Valued Quantities
The logic decision which results into either YES (TRUE) or NO (FALSE) is called a
Binary Decision. Binary decision making also applies to formal logic.

Example:
August 15 is the Independence Day. ->True
12-2=12 ->False
What do you say? ->Cannot answered
What did I tell you yesterday? ->Cannot answered

Thus sentences which can be determined to be true or false are called logical
statements or truth functions and the results TRUE or FALSE are called truth
values. The truth values are depicted by logical constants TRUE and FALSE. Or 1
and 0.
The variables which can store these truth values are called logical variables or
binary valued variables .
 0
Logical 1
Operations
Logical Function or Compound
Function
There are some specific operations that can be applied on logical statements or truth
functions.
Algebraic variables like a,b,c or x,y,z etc are combined with the help of mathematical
operators like +,-,* etc to form algebraic expression.
Similarly, logic statements or truth functions are combined with the help of logical
operators like AND, OR and NOT to form compound statement or logical function.
Example:
1. He prefers tea not coffee.
2. He plays guitar and she plays sitar.
3. I watch TV on Sundays or I go for Swimming.
These logical operators are also used to combine logical variables and logical constants to
form logical expressions. Eg: X NOT Y OR Z
Logical Operators
A Truth Table is a table which represents all the possible values of logical variables /
statements along with all the possible results of the given combinations or values.
NOT Operator
X Not X
Tautology
0 1
(always True)
1 0
X Y X+Y
0 0 0
OR Operator 0 1 1
1 0 1
(Ս or v instead of +) Fallacy (Always False)
1 1 1
X Y X.Y
0 0 0
0 1 0
AND Operator 1 0 0
1 1 1
 Evaluation Boolean Expressions using
Truth Table
Logical variables are combined by means of logical operators (AND, OR, NOT) to
form a boolean expression.
Example: X +YZ

Examples from textbook

What is a Logic Gate?
A Gate is a basic electronic circuit that performs a logical operation
on one or more inputs to produce single output.

Gates are digital (two state) circuits because the input and output
signals are either low voltage (denotes 0) or high voltage (denotes
1).

Gates are often called logic circuits because they can be analyzed
with boolean logic.

There are 3 types of logic gates: AND, OR NOT

Inverter (NOT Gate)
An Inverter (Not Gate) is a gate with only one
input signal and one output signal; the output
state is always the opposite of the input state.

The output is sometimes called the Complement

of the input.
 OR Gate
The OR Gate has two or more input signals but only one output
signal.
If any of the input signals is 1 (high), the output signal is 1 (high).
If all inputs are 0 then output is also 0.
If one or more inputs are 1, the output is 1.
AND Gate
The AND Gate can have two or more than two input
signals and produce an output signal.
When all the inputs are 1 then the output is 1. otherwise
the output is 0 only.
If any of the input is 0, the output is 0.
 Basic Postulates of Boolean
Logic
Boolean logic algebra, being a system of mathematics, consists of fundamental laws that are used to build a
workable, cohesive framework upon which are based the theorems of Boolean algebra.
These fundamental laws are known as Basic postulates of Boolean logic algebra . These postulates state basic
relations in Boolean algebra, that follow:

I. If x≠0 then x=1; and x≠1 then x=0

II. OR Relations (Logical Addition) -> 0+0=0; 0+1=1; 1+0=1; 1+1=1
III.AND Relations (Logical Multiplication) -> 0.0=0; 0.1=0; 1.0=0; 1.1=1
IV. Complement Rules:
A = 1 → A' = 0
A = 0 → A' = 1
.
 Original expression:
A+0=A

Principle of
Dual expression:
A·1=A
✅ Both expressions are valid in
Boolean Algebra.

Duality
This is a very important principle used in Boolean logic. This states that every Boolean expression has
a dual expression, which can be derived by:

1 2 3
Changing each Changing each Replacing each 0
OR sign (+) to an AND sign (.) to an by 1 and each 1
AND sign (.) OR sign (+) by 0.
 Basic Theorems of Boolean Algebra Logic
• Boolean Algebra are used to define basic theorems of Boolean algebra that provide all the tools
necessary for manipulating Boolean expressions. These properties also help to design digital
circuits.
1. Properties of 0 and 1.
(a) 0 + X = X (b) 1 + X = 1 (c ) 0 · X = 0 (d) 1 · X = X
 Basic Theorems of Boolean Algebra Logic
2. Idempotence Law 3. Involution Law
If A is a statement then,
(a) A + A = A
(b) A. A = A
 Basic Theorems of Boolean Algebra Logic
4. Complementary Law 5. Commutative Law
(a) X+Y= Y+X
(b) X.Y =Y.X
 Basic Theorems of Boolean Algebra Logic
6. Associative Law 7. Distributive Law
(a) X(Y+Z)=XY +XZ
(a) A+(B+C)=(A+B)+C (b) X+YZ=(X+Y)(X+Z)
(b) A(BC)=(AB)C
 Basic Theorems of Boolean Algebra Logic
8. Absorption Law
X+XY=X
X(X+Y)=X
 DeMorgan’s Theorem
• DeMorgan’s Theorems are two important rules in Boolean Algebra used for:
• Simplifying expressions: reduce complex Boolean expressions into simpler forms by relating AND and
OR operations. This simplifies circuit designs and calculations.
• Converting logic circuits (especially when using NAND/NOR gates)
• The two laws of De Morgan's theorem are:
• First Law: The complement of a sum of variables is equal to the product of their individual
complements

• Second Law: The complement of a product of variables is equal to the sum of their individual
complements

• These laws have broader applications beyond digital circuit design, including mathematics (set
theory and propositional logic) and computer science (programming and algorithm design).
 More about Logic Gates
• Logic gates are fundamental electronic circuits that perform basic logical operations on binary
inputs (0 or 1) to produce a single binary output. They are the building blocks of digital systems,
including computers, calculators, and other electronic devices. Each gate has a specific function,
determined by its design, which dictates how it processes the inputs to generate the output.
• The Gates include: NOR, NAND, XOR, XNOR gates.

1. NOR Gate: It have two or more input signals but only one output signal. NOR gate is inverted
OR gate. If either of the two inputs is 1, the output will be 0.
 More about Logic Gates
2. NAND Gate: It have two or more input signals but only one output signal. NAND gate is
inverted AND gate. If all the inputs are 1, then the output is 0.
 More about Logic Gates
3. XOR Gate (Exclusive OR Gate): It can have two or more input signals but only one output
signal. OR gate produces output 1 for any input combination having one or more 1’s. but XOR
gates produces output 1 for only those input combinations that have odd number of 1’s.
 More about Logic Gates
4. XNOR Gate (Exclusive NOR Gate): it is logically equivalent to an inverted XOR i.e., XOR
gate followed by a NOT gate. Thus XNOR produces 1 output when the input combination has even
number of 1’s. the small circle on the outputs represents complementation.
 Rules to create Logic circuits
• A logical circuit (also called a logic circuit or digital circuit) is a combination of logic gates that
processes binary inputs (0s and 1s) to produce a specific binary output based on Boolean algebra.

Rules to create a logic circuit are:

1. Break Down the Boolean Expression: Split complex expressions into smaller parts and build each
part step by step.
Y=(A+B)⋅C′ Step-by-step breakdown:
• First: A + B → Use an OR gate
• Second: C' → Use a NOT gate
• Third: (A + B) · C' → Use an AND gate to combine
2. Use One Gate per Operation: Each logical operation (AND, OR, NOT) in a Boolean expression must be
implemented using one logic gate in the circuit.
Y=(A+B)⋅C′ This has three operations:
• A+B → OR operation → needs 1 OR gate
• C′→ NOT operation → needs 1 NOT gate
• (A+B)⋅C′→ AND operation → needs 1 AND gate
 Rules to create Logic circuits
3. Implement the sub expressions using the gates determined. Y=(A+B)⋅C′

4. Determine the Logic Gate for the symbol joining the sub expression using + symbol.
5. Using the Logic gates for the joining symbol connect the sub expressions gate implementation.
6. Our circuit diagram is ready.
Thank
You