BooleanLogic U

Boolean Logic
Boolean Algebra and

Logic Gates
George Boole
Father of Boolean algebra
He came up with a type of linguistic algebra, the three
most basic operations of which were (and still are) AND,
OR and NOT. It was these three functions that formed the
basis of his premise, and were the only operations
necessary to perform comparisons or basic mathematical
functions.
Boole’s system was based on a binary approach,
processing only two objects - the yes-no, true-false, on-
off, zero-one approach.
Surprisingly, given his standing in the academic community, George Boole (1815 - 1864)
Boole's idea was either criticized or completely ignored by
the majority of his peers.
Eventually, one bright student, claude shunnon(1916-2001),
picked up the idea and ran with it
2
DEFINITION:
Boolean Algebra is the algebra of

truth values and operations
performing on them which is used
in Digital Circuits for performing
logical operations.
Symbolic Logic
Boolean algebra derives

its name from the Mathematician George Boole.
Symbolic Logic uses values, variables and operations :

− True is represented by the value 1.
− False is represented by the value 0.
Variables are represented by letters and can have one of two values,
either 0 or 1.
Operations are functions of one or more variables.
− AND is represented by X.Y
− OR is represented by X + Y
− NOT is represented by X' .
Throughout this tutorial the X' form will be used and sometimes !X will be used.
VENN DIAGRAMS
Boolean Logic Expressions can be expressed figuratively using Venn Diagrams
Boolean Logic
1. Boolean Algebra is an algebra that deals with Boolean

values (TRUE and FALSE).
2. Truth Table : Truth table is a table which represents

all the possible values of logical variables/statements
along with all possible results of given combination of values.
Boolean Constants and Variables
 Logical statements can have either two values yes or

no, true or false, 0 or 1.
 Boolean 0 and 1 do not represent actual numbers
but instead represent the state, or logic level.
Logic 0 Logic 1
False True
Off On
Low High
No Yes
Open switch Closed switch
Truth Tables
 A truth table is a means for describing how a logic

circuit’s output depends on the logic levels present at
the circuit’s inputs.
Inputs Output
A B x
1 1 1
? x
0 1 0
B
1 0 0
0 0 0
Three Basic Logic Operators
 OR
 AND
 NOT
OR Operation
 Boolean expression for the OR

operation: x =A + B
 The above expression is read as “x equals A OR B”
AND Operation
 Boolean expression for the AND

operation: x =A B
 The above expression is read as “x equals A AND
B”
NOT Operation
 The NOT operation is an unary operation, taking only one
input variable.
 Boolean expression for the NOT operation:
x= A
 The above expression is read as “x equals the inverse of
A”
 Also known as inversion or complementation.
 Can also be expressed as: A’
A
LOGIC GATES
Logic gates are the basic building blocks of any digital system. It is
an electronic circuit having one or more than one input and only one
output. The relationship between the input and the output is based on
a certain logic.
 OR
 AND
 NOT
 NAND
 NOR
OR Gate
 An OR gate is a gate that has two or more inputs

and whose output is equal to the OR combination of
the inputs.
AND Gate
 An AND gate is a gate that has two or more inputs

and whose output is equal to the AND product of the
inputs.
NOT Gate
The symbol and Truth Table for NOT gate is given below:
A
Describing Logic Circuits
Algebraically
 Any logic circuits can be built from the three basic
building blocks: OR, AND, NOT
 Example 1: x = A B + C
 Example 2: x = (A+B)C
 Example 3: x = (A+B)
Examples 1,2
Examples 3
Evaluating Logic-Circuit
Outputs
 x = ABC(A+D)
 Determine the output x given A=0, B=1, C=1, D=1.

 Can also determine output level from a diagram
Examples
Draw the Logic Gate:
 AB+C’D
 A(B+C’) + B’D’
 A’ [ (B+C)’ + AB]
Draw the Truth Table:

 AB+(BC)’
 A(B’+C’) + BC’
 X’[ (Y+Z)’ + XY]
Derive the Boolean Expression
NAND Gate
 Boolean expression for the NAND operation:

x=AB
NOR Gate
 Boolean expression for the NOR operation:
x=A+B
Boolean Theorems and Laws
 x* 0 =0 Fallacy
 x+1=1 Tautology
 x*x=x Indempotence Law
 x+x=x Indempotence Law
 x*x’=0 Complementarity Law
 x+x’=1 Complementarity Law
 x” = x Involution Law
 x+0=x
 x* 1 =x
Boolean Theorems and Laws
 x+y = y+x // Commutative Law

 x*y = y*x
 x+(y+z) = (x+y)+z=x+y+z // Associative Law
 x(yz)=(xy)z=xyz
 x(y+z)=xy+xz // Distributive Law
 (w+x)(y+z)=wy+xy+wz+xz
 x+xy=x // Absorption Law
Prove it by Truth Table

De’Morgan’s Theorems
(Break the line change the sign)
 (x+y)’=x’y’
 Implications and alternative symbol for NOR function
 (xy)’=x’+y’
 Implications and alternative symbol for NAND function
 Process of Demorganization:
(i) Complement entire function
(ii) Change all AND to OR and all OR to AND
(iii) Complement each of the individual variables
Demorgan’s Theorum
Demorgan’s Theorum
Universality of NAND Gates
Universality of NOR Gates

BooleanLogic U

Uploaded by

Copyright:

Available Formats

BooleanLogic U

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BooleanLogic U

Uploaded by

Copyright:

Available Formats

Boolean Logic

Boolean Algebra and

Boolean Algebra is the algebra of

Boolean algebra derives

Symbolic Logic uses values, variables and operations :

1. Boolean Algebra is an algebra that deals with Boolean

2. Truth Table : Truth table is a table which represents

 Logical statements can have either two values yes or

 A truth table is a means for describing how a logic

 Boolean expression for the OR

 Boolean expression for the AND

 An OR gate is a gate that has two or more inputs

 An AND gate is a gate that has two or more inputs

 Determine the output x given A=0, B=1, C=1, D=1.

Draw the Truth Table:

 Boolean expression for the NAND operation:

 x+y = y+x // Commutative Law

Prove it by Truth Table

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.