Scribd
Upload
31 views21 pages

Matkom 4 - Logic and Proof (Logical Equivalence)

Uploaded by

fika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
31 views21 pages

Matkom 4 - Logic and Proof (Logical Equivalence)

Uploaded by

fika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

SISTEM

FAKULTAS ILMU KOMPUTER UPN VETERAN


INFORMASI
JATIM

Matematika
SI231118

Komputasi
Week 4 Logic and Proof
Rafika Rahmawati, S.Kom., M.Kom.,
MBA.
Outline

01 Propositional Equivalence
02 Logical Equivalence
Summary Logical Operators
not not and or xor conditional Bi-conditional
p q p q pq pq pq pq pq
T T F F T T F T T
T F F T F T T F F
F T T F F T T T F
F F T T F F F T T
Previous
Assignment

Tentukan Nilai Kebenaran (truth value) dari :


1. p  ~(p  q)
Previous
Assignment

Tentukan Nilai Kebenaran (truth value) dari :

2. (p  q)  ~(p  q)
Propositional
Equivalence
Propositional Equivalence

1 TAUTOLOGY
a statement (compound prop.) that’s always
TRUE

2 CONTRADICTION
a statement (compound prop.) that’s always
FALSE

CONTINGENCY
3 a statement (compound prop.) that’s
neither a tautology nor contradiction.
EXAMPLE
We can construct examples of tautologies and contradictions using just one
propositional variable.
Consider the truth tables of p ∨ ¬p and p ∧ ¬p, shown in Table 1.
Because p ∨ ¬p is always true, it is a tautology.
Because p ∧ ¬p is always false, it is a contradiction.
Logical
Equivalence
Logical
Equivalence
Hukum Aljabar
Proposisi

Dua buah proposisi majemuk P (p, q, ….)


dan Q (p, q, …) disebut ekivalen secara
logika jika keduanya mempunyai tabel
kebenaran yang sama

Symbol is ≡ or ⇔

T menunjukkan proposisi majemuk yang selalu


benar
F menunjukkan proposisi majemuk yang selalu
salah.
Salah satu cara untuk menentukan apakah dua proposisi majemuk setara
adalah dengan menggunakan tabel kebenaran.

Contoh : ekuivalensi dari ¬(p ∨ q) dengan ¬p ∧ ¬q. (Hukum De Morgan)

Show that ¬(p ∨ q) and ¬p ∧ ¬q are


logically equivalent.
EXAMPLE
Show that p → q and ¬p ∨ q are logically equivalent
Example
 Identity law p  T
p
p T pT
T T T
F T F
Example
 Commutative law pqqp

p q pq qp
T T T T
T F F F
F T F F
F F F F
We will now establish a logical equivalence of two compound
propositions involving three different propositional variables p, q,
and r.

Show that p ∨ (q ∧ r) and (p ∨ q) ∧ (p ∨ r) are


logically equivalent

The
distributive law
of disjunction over
conjunction.
Example
 Associative law (p  q)  r  p  (q  r)

p q r pq (pq)r qr p(qr)


T T T T T T T
T T F T F F F
T F T F F F F
T F F F F F F
F T T F F T F
F T F F F F F
F F T F F F F
F F F F F F F
Equivalences yang berguna
untuk proposisi majemuk yang
melibatkan conditional
statements & biconditional
statements

*bisa dicoba membuktikan ekuivalensi sebagai


latihan
EXAMPLE Soal Hukum Aljabar Proposisi

Show that ¬(p → q) and p ∧ ¬q are logically


equivalent.
EXAMPLE Soal Hukum Aljabar
Proposisi

Show that ¬(p ∨ (¬p ∧ q)) and ¬p ∧ ¬q are


logically equivalent
EXAMPLE Soal Hukum Aljabar
Proposisi

Show that p v ~(p v q) and p v ~q are logically


equivalent
EXAMPLE Soal Hukum Aljabar
Proposisi

Show that p ∧ (p v q)  p are logically equivalent

You might also like