LOGIC 2

LECTURE 3 TR1333 DISCRETE MATHEMATICS

Learning By the end of the lecture, you should be able to:
1. Explain the concept of Logical Equivalence,

Outcomes Converse, Contrapositive, Tautology,

Contradiction and De Morgan’s Laws; and
2. Solve the truth value of Logical Equivalence,
Converse, Contrapositive, Tautology,
Contradiction and De Morgan’s Laws using
truth tables.
 Logical
Equivalence

De
Morgan’s Converse
Law

Logic

Contradiction Contrapositive

Tautology
 Logical • Two propositions P and Q are said to be
logically equivalent (written P ≡ Q) if their truth

Equivalence tables are identical.

Example
~p  q is logically equivalent to p  q

p q ~p  q pq
T T T T
T F F F
F T T T
F F T T
ACTIVITY 1 1. Show that ~(p  q) is logically
equivalent to p ^ ~q,
i.e. ~(p  q) ≡ p ^ ~q

2. Show that p  q is logically equivalent

(p  q) ^ (q  p),
i.e. p  q ≡ (p  q) ^ (q  p)
Converse • The converse of p  q is q  p

p q pq qp
T T T T
T F F T
F T T F
F F T T
Contrapositive • The contrapositive of the proposition pq is
~q  ~p.

p q pq ~q  ~p
T T T T
T F F F
F T T T
F F T T
Tautology • A proposition is a tautology if its truth table
contains only true values for every case

Example
ppvq

p q ppvq
T T T
T F T
F T T
F F T
Contradiction • A proposition is a contradiction if its truth table
contains only false values for every case
Example
p ^ ~p

p p ^ (~p)
T F
F F
 De Morgan’s • The following pairs of propositions are logically
equivalent:

Law A. ~ (p  q)  (~p)  (~q)

B. ~ (p  q)  (~p)  (~q)

p q ~p ~q ~ (p  q) (~p)^(~q) p q ~p ~q ~ (p ^ q) (~p) (~q)

T T F F T T F F
T F F T T F F T
F T T F F T T F
F F T T F F T T
ACTIVITY 2 • Given “If the network is down, then UKM
cannot access the Internet”
1. Write the conditional proposition symbolically.
2. Write the contrapositive and the converse
symbolically and in words.
3. Assuming that the network is not down and
UKM can access the internet, find the truth
value of the original proposition, its
contrapositive, and its converse.