Scribd
Upload
27 views17 pages

Logical Equivalens

Uploaded by

riskilampung297
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
27 views17 pages

Logical Equivalens

Uploaded by

riskilampung297
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/ 17

Logical Equivalences

Universitas Teknokrat Indonesia


Fakultas Teknik dan Ilmu Komputer
Objectives

• Terminology Logical Equivalences


• Establishing logical equivalences using truth
tables
• Establishing logical equivalences using known
laws (of logical equivalences)
Converse, Inverse, Contrapositive

Let p  q is known then


Converse is qp
Inverse is p  q
Contrapositive is q  p

Implication  Contrapositive
p q p q p  q q  p p  q q  p

T T F F T T T T

T F F T F T T F

F T T F T F F T

F F T T T T T T

Equivalent Value
p  q  q  p Equivalent Value
Or different meaning q  p  p  q
(p  q)  (q  p) Or Different meaning
is Tautology (q  p)  (p  q)
is Tautology
Logical Equivalences

• Definition: Propositions p and q are


logically equivalent if p  q is a tautology.
• Informally, p and q are equivalent if
whenever p is true, q is true,
• Notation: p  q (p is equivalent to q), p  q,
and p  q
• Alert:  is not a logical connective
Example 1
1.Determination of whether the sentences below equivalent
a. (p)  p

p p (p)
T F T
F T F

Equivalent Value
(p)  p
Example 2
b. (pq)  p  q
p q pq (pq) p q p  q
T T T F F F F
T F F T F T T

F T F T T F T
F F F T T T T

Equivalent Value
(pq)  p q
Example 3
c. p  q  p  q
p q pq p p  q
T T T F T
T F F F F
F T T T T
F F T T T

Equivalent Value
p  q  p  q
Laws of Equivalence Logic
1. Comutative Law 2. Associative Law 3. Distributive Law
pqqp (p  q)  r  p  (q  r) p  (q  r)  (p  q)  (p  r)
pqqp (p  q)  r  p  (q  r) p  (q  r)  (p  q)  (p  r)
4. Identity Law 5. Bounded Law 6. Negation Law
pTp pFF p  p  F
pFp pTT p  p  T
7. Double Negation 8. Idempoten Law 9. De Morgan Law
Law ppp (p  q)  p  q
(p)  p ppp (p  q)  p  q
10. Absorbe Law 11. Negation T and F 12. Implication Law
p  (p  q)  p T  F p  q  p  q
p  (p  q)  p F  T
13. Contrapositive Law 14. Biimplication Law
p  q  q  p p  q  (p  q)  (q p)
Example
1. Simplify form (pq)(pq) with laws of
equivalence logic
Solution:
(pq)(pq)
 ((p)q)(pq) (De Morgan)
 (pq)(pq) (Double
negation)
 p(qq) (Distributive)
 pF (Negation)
p (Identity)
2.Proof of simplify form with laws of equivalence logic
a. (pq)  (pq)  p
Solution:
(pq)  (pq)
 (p(q))  (pq) (De Morgan)
 (pq)  (pq) (Double Negation)
 p(qq) (Distributive)
 pT (Negation)
 p (Identity)
b. ((pq)(pq))  (pq)  p
Solution:
((pq)(pq))  (pq)
 (p(qq))  (pq) (Distributive)
 (pT))  (pq) (Negation)
 ((p)T))  (pq) (De Morgan)
 (pF)  (pq) (Negation T & F)
 p(pq) (Identity)
p (Absorbe)
TAUTOLOGY AND CONTRADICTION

• Tautology is a form of sentence that always be true ( True


) no matter what the truth value of each constituent
sentence , otherwise a contradiction is a form of wording
which is always worth one ( False ) , no matter what the
truth value of each constituent sentence .

• If a tautology sentence handed down through the laws that


exist in the end will produce True , otherwise
contradictions will always False.
Example
1. Show that the sentences below is
Tautologies using truth tables
a. (p  q)  q

p q pq (pq)  q
T T T T
T F F T Each Rows is T
So (p  q)  q
F T F T is Tautology
F F F T
b. ~(q  (pq))

p q pq ~(q  (pq))


T T T F
T F T F Each Rows is F
So ~(q  (pq))
F T T F is Contradiction
F F F F
Exercise
1. Tunjukkan bahwa (p  q)  (p  r) ekuivalen dengan p  ( q  r)
menggunakan Tabel Kebenaran dan Hukum Ekuivalensi.

2. Tunjukkan bahwa (p  r)  (q  r) ekuivalen dengan (p  q )  r


menggunakan Tabel Kebenaran dan Hukum Ekuivalensi.

3. Tunjukkan bahwa  p  (q  r) ekuivalen dengan q  (p  r )


menggunakan Tabel Kebenaran dan Hukum Ekuivalensi.

4. Tunjukkan bahwa (p  q)  (q  p) is Tautologi dengan


menggunakan Tabel Kebenaran dan Hukum Ekuivalensi.

You might also like