Discrete Structures

Lecture 3
Quiz next week (all contents
covered till date) means today’s
topics also)
Announce to other group also
 Previous
 Introduction to the course
 Applications of DS

 Propositions

 Logical connectives

 Truth tables

 Compound propositions

3
 Today’s discussion
 Translating English to Logic and Logic to
English
 Logical Equivalence

 De Morgan’s laws

 Tautologies and Contradictions

 Laws of logic

 Simplification of compound propositions

4
English and Logic

Examples
 Logical Equivalence
 Two proposition form are called logically
equivalent if and only if they have identical truth
values for each possible substitution of
propositions for their proposition variable.
 The logical equivalence of proposition forms P
and Q is written as P≡Q

6
 Equivalence of compound propositions
P and Q
 Construct the truth table for P.
 Construct the truth table for Q using the same
proposition variables for identical component
propositions.
 Check each combination of truth values of the
proposition variables to see whether the truth
value of P is the same as truth value of Q.

7
 Equivalence Check

 If in each row the truth value of P is the same as

the truth value of Q, then P and Q are logically
equivalent
 If in some row P has a different truth value from
Q, then P and Q are not logically equivalent
 Example

8
 De Morgan’s Laws
 The negation of an and proposition is logically
equivalent to the or proposition in which each
component is negated.
 The negation of an or proposition is logically
equivalent to the and proposition in which each
component is negated.
 Applying De Morgan’s Laws
 Inequalities and De Morgan’s Laws

9
 Tautology
 A tautology is a proposition form that is always
true regardless of the truth values of the
individual propositions substituted for its
propisition variables.
 A proposition whose form is a tautology is called
a tautological proposition.
 Example

10
 Contradiction
 A contradiction is a proposition form that is
always false regardless of the truth values of the
individual propositions substituted for its
propisition variables.
 A proposition whose form is a contradiction is
called a contradictory proposition.
 Example

11
Task
 Laws of Logic
 Commutative law
 Associative law
 Distributive law
 Identity law
 Negation law
 Double negation law
 Idempotent law
 Universal bound law
 Absorption law
 Negation of t and c
13
Namaz break
Task

Using laws of Logic, show that

Questions & Discussion
Attendance