Scribd
Upload
2 views

csWithPython3

Chapter 3 discusses the development and principles of Boolean logic, highlighting key figures such as Aristotle, George Boole, and Claude E. Shannon. It covers binary valued quantities, logical operations, and various logic gates, including AND, OR, and NOT gates, along with their functions. Additionally, the chapter outlines fundamental postulates, theorems, and laws of Boolean algebra, including De Morgan's theorems.

Uploaded by

Malik Nayab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

csWithPython3

Chapter 3 discusses the development and principles of Boolean logic, highlighting key figures such as Aristotle, George Boole, and Claude E. Shannon. It covers binary valued quantities, logical operations, and various logic gates, including AND, OR, and NOT gates, along with their functions. Additionally, the chapter outlines fundamental postulates, theorems, and laws of Boolean algebra, including De Morgan's theorems.

Uploaded by

Malik Nayab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CHAPTER 3 : Boolean Logic

DEVELOPMENT
• Aristotle constructed a complete system of formal logic
• wrote six works on the subject
• George Boole first used symbolic notations for his own mathematical system of logic.
• wrote 'An investigation of the laws of the thought' => 1854 => Boolean Algebra
• 1938 : Claude E. Shannon => 'A symbolic Analysis of Relay Switching Circuits'.
• boolean algebra => switching algebra

Binary Valued Quantities


• Binary decisions
• Truth values
• logical statements or truth functions
• binary valued variables

Logical Operations
• statements combined with binary valued variables and logical operators => logical
expressions
Logical Operators
• Truth table : represents all the possible values of logical variables statements along with
all the possible results of the given combinations of values.
• Tautology : if the result of any logical statement or expression is always TRUE for all
input combinations
• Fallacy : if the result of any logical statement is always FALSE for all input combinations.
• NOT => complementation or negation
◦ unary operator
◦ bar over X , or ~X
• OR => logical addition
◦ X OR Y => X + Y
◦ other symbols : U , v , V
• AND => logical multiplication
• X AND Y => X . Y (.)
• X . Y . Z => XYZ

Evaluation of Boolean Algebra


• Truth table of n input variables ==> 2n input combinations => rows in table
• using truth tables to find the expression
• Precedence of Operators : NOT => AND => OR

Basic Logic Gates


• boolean algebra in electronic circuit => logic gates
• Gate : basic electronic circuit which operates on one or more signals to produce an
output signal.
• signals are often high voltage ( 1 ) or low voltage ( 0 )

Inverter ( NOT gate )


• one input and and output where the output is always opposite of input.
• F = X'
•

OR gate
• two or more input signals but only one output signal.
• if any input is high (1) the output will be high ( 1 )

AND gate
• two or more input signals but only one output signal
• if all inputs are high ( 1 ) => output will be high, otherwise low ( 0 )

NOR gate
• two or more input signals but only one output signal.
• if any input is high (1) the output will be low ( 0 )
• inverted OR gate

NAND gate
• two or more input signals but only one output signal
• if all inputs are high ( 1 ) => output will be low ( 0 ) , otherwise high ( 1 )
• inverted AND gate

XOR gate
• two or more input signals but only one output signal
• output is high only when input has a combination for odd no. of 1s

XNOR gate
• inverted XOR gate
• output is high only when input has a combination for even no. of 1s
•

Basic Postulates of BOOLEAN LOGIC


Principle of Duality
• statement : starting with a boolean relation another boolean relation can be derived by :
1. each OR sign ( + ) => AND sign ( . )
2. each AND sign ( . ) => OR sign ( + )
3. replacing each : 0 -> 1 and 1 -> 0
• derived relation from this principle : dual of original expression
• if a expression is true than its dual is also true
•

Theorems of Boolean Algebra

Properties of 0 and 1
1. 0 + X = X
2. 1 + X = 1 --> Tautology
3. 0.X = 0 --> Fallacy
4. 1.X = X
Idempotent Laws
1. X + X = X
2. X . X = X
• 1 and 2 are duals of each other
Involution
• ~(~X) or (X')' = X
• also known as double inversion

Complementarity Law
1. X + X' = 1 --> Tautology
2. X . X' = 0 --> Fallacy
Commutative Law
1. X + Y = Y + X
2. X . Y = Y . X
Associative Law
1. X + ( Y + Z ) = ( X + Y ) + Z
2. X ( YZ ) = ( XY )Z
Distributive Law
1. X ( Y + Z ) = XY + XZ
2. X + YZ = ( X + Y )( X + Z )
• 2 is the dual of 1
• X + YZ expression is sum of two product-terms (X.1,YZ) and (X + Y)(X + Z) is product of
sum-terms (X + Y, X + Z). So, this law is a useful one to convert sum-of-product type
expression to product-of-sum type expression and vice-versa.
• 3rd distributive law : X + X'Y = X + Y

Absorption law
1. X + XY = X
2. X ( X + Y ) = X
• 2 is the dual of 1

DEMORGAN'S THEOREMS
• ​ A' ⋅ B'
( A+B )' =
• ( A ⋅ B )' = A' + B'
• Demorganization refers to simplifying or transforming Boolean expressions by applying
De Morgan's Laws

You might also like