Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
20 views8 pages

Boolean Logic

Boolean logic is an algebraic system where variables can only be true or false, foundational for computer science and digital circuits. Introduced by George Boole in 1854, it involves elements, operators (AND, OR, NOT), and theorems for analyzing and designing digital circuits. Logic gates, which perform basic logical functions, are essential components in electronic products like computers and calculators.

Uploaded by

manishadthakur18
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
0% found this document useful (0 votes)
20 views8 pages

Boolean Logic

Boolean logic is an algebraic system where variables can only be true or false, foundational for computer science and digital circuits. Introduced by George Boole in 1854, it involves elements, operators (AND, OR, NOT), and theorems for analyzing and designing digital circuits. Logic gates, which perform basic logical functions, are essential components in electronic products like computers and calculators.

Uploaded by

manishadthakur18
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/ 8

Boolean Logic

What is Boolean logic?


Boolean logic is a system of algebra where variables can only have two possible values true
or false (often represented as 1 or 0).
It's a foundation for computer science and digital circuits, relying on logical operations like
AND, OR, and NOT to evaluate expressions and determine truth values

Boolean algebra
Boolean Algebra was introduced by George Boole in 1854.
As Boolean logic allows things to be mapped into bits and bytes, it has application in
telephone switching circuits, electronics, computers (both hardware and software), etc.
Boolean algebra, which is algebra of two values may be (True, False) or (Yes, No) or (0, 1), is
an important tool in analyzing, designing and implementing digital circuits

Boolean Algebra is made up of


 Elements - which are variables or constants with value 1 or 0.
 Operators - which are And, Or and Not.
 Theorems

Boolean variable
 A Boolean variable is a symbol used to represent a logical quantity.
 It will take value from the domain {0, 1}, and Boolean constant is single digit binary
value (bit) viz. 0 or 1.

Boolean Operators (AND, OR, NOT)


AND operator:-
 There are three fundamental operators- AND, OR and NOT.
 AND is a binary operator, to perform logical multiplication, it is represented by ‘.’
OR operator:-
 OR is also a binary operator, to perform logical addition.
 It is represented by '+'.

NOT operator:-
 NOT is a unary operator, to complement the operand.
 Not is represented as 'or .
 Complement is the inverse of a variable/ constant.

Logic Circuits
 A digital electronic circuit which is built up from certain elementary circuits called
logic gates and perform logical operation on data.
 It is a logic network or structure of logic gates.
 Most electronics products such as computers, video games, rotbots, calculators etc.
have some forms of logical circuits.
Logic Gates
 Are elementary electronic circuits that performs basic logical function (Boolean
function) such as AND, OR and NOT.
 It is a block of hardware that produces a logic 0 or logic 1 output, in response to
the binary signal to it as input.
 Most logic gates have two inputs and one output.
There are seven logic gates:
 AND
 OR
 NOT
 NAND
 NOR
 XOR
 XNOR
Universal Logic gates:-
TRUTH TABLE

EXAMPLE OF TRUTH TABLE


1) Truth table for 2 variables:-

2) Truth table for 3 variables:-


De Morgan's Theorem:

 De Morgan's First Theorem (Complement of a Sum):


 The complement of the sum of two or more variables is equal to the
product of the complements of those variables.
 In Boolean notation:
(A + B)' = A' ⋅ B'
 De Morgan's Second Theorem (Complement of a Product):
 The complement of the product of two or more variables is equal to the
sum of the complements of those variables.
 In Boolean notation:
(A ⋅ B)' = A' + B'

You might also like