PRESENTATION

SET AND LOGIC

Senin | 14 November 2016
TEAM
Suhartati (F1041131006)

Rasmania (F1041131013)

Farid Fadhlurrahman (F1041161002)

Muhammad Akil (F10411610)

Riema Lestari (F10411610)

Dea Fitriani (F10411610)

Rini Wijayanti (F10411610)

1.7 Prove the following equivalences by
drawing the truth tables
a) ¬𝑝 ∨ ¬𝑞 ≡ ¬(𝑝 ∧ 𝑞)
b) 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
c) 𝑝 ↔ 𝑞 ≡ 𝑝 → 𝑞 ∧ 𝑞 → 𝑝
d) 𝑝 → (𝑞 → 𝑟) ≡ 𝑞 → (𝑝 → 𝑟)

NEXT
a) ¬𝑝 ∨ ¬𝑞 ≡ ¬(𝑝 ∧ 𝑞)

𝑝 𝑞 𝑝ҧ 𝑞ത 𝑝∧𝑞 𝑝ҧ ∨ 𝑞ത ¬(𝑝 ∧ 𝑞)

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

EQUIVALENT BACK
b) 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞

𝒑 𝒒 ഥ
𝒑 𝒑→𝒒 ഥ∨𝒒
𝒑
T T F T T
T F F F F
F T T T T
F F T T T

EQUIVALENT BACK
c) 𝑝 ↔ 𝑞 ≡ (𝑝 → 𝑞) ∧ (𝑞 → 𝑝)
𝒑 𝒒 𝒑→𝒒 𝒒→𝒑 𝒑↔𝒒 (𝒑 → 𝒒) ∧ (𝒒 → 𝒑)
T T T T T T
T F F T F F
F T T F F F
F F T T T T

EQUIVALENT BACK
d) 𝑝 → (𝑞 → 𝑟) ≡ 𝑞 → (𝑝 → 𝑟)

𝒑 𝒒 𝒓 𝒒→𝒓 𝒑→𝒓 𝒑 → (𝒒 → 𝒓) 𝒒 → (𝒑 → 𝒓)

T T T T T T T
T T F F F F F
T F T T T T T
T F F T F T T
F T T T T T T
F T F F T T T
F F T T T T T
F F F T T T T
EQUIVALENT BACK
The contrapositive of 𝑝 → 𝑞 is the proposition ¬𝑞 → ¬𝑝. it can
be shown that these two are equivalent : 𝑝 → 𝑞 ≡ ¬𝑞 → ¬𝑝

1.8 Write an equivalent statement using contrapositive.

a) If I study hard, then I get good mark
b) If it rains, then it is not hot
c) If today is not Sunday, then tomorrow is not Monday
d) If I am not lazy, then I come to the lecture

BACK NEXT
a) If I study hard, then I get good mark

p: I study hard ¬p : I not study hard

q: I get good mark ¬q : I not get good mark

Contrapositive p→q is ¬q→¬p, so the contapositive is

If I not get good mark, then I not study hard

BACK
b) If it rains, then it is not hot

p: It rains ¬p : It not rains

q: It is hot ¬q : It is not hot

Contrapositive p→ ¬q is q→¬p, so the contapositive is

If it is hot, then it not rains

BACK
c) If today is not Sunday, then tomorrow is not Monday

p: Today is Sunday ¬p : Today is not Sunday

q: Tomorrow is Monday ¬q : Tomorrow is not Monday

Contrapositive ¬p→¬q is q→p, so the contapositive is

If tomorrow is Monday, then today is Sunday

BACK
d) If I am not lazy, then I come to the lecture

p: I am lazy ¬p : I am not lazy

q: I come to the lecture ¬q : I not come to the lecture

Contrapositive ¬p→q is ¬q→p, so the contapositive is

If I not come to the lecture, then I am lazy

BACK
The converse of 𝑝 → 𝑞 is the proposition 𝑞 → 𝑝

1.9 Write the converse of the proporsitions in Problem 1.8. is

𝑝→𝑞 ≡ 𝑞→𝑝?
a) If I study hard, then I get good mark
b) If it rains, then it is not hot
c) If today is not Sunday, then tomorrow is not Monday
d) If I am not lazy, then I come to the lecture

BACK NEXT
a) If I study hard, then I get good mark

p: I study hard
q: I get good mark

Converse p→q is q→p, so the converse is

If I get good mark, then I study hard

BACK
b) If it rains, then it is not hot

p: It rains ¬p : It not rains

q: It is hot ¬q : It is not hot

Converse p→ ¬q is ¬q→p, so the converse is

If it is not hot, then it rains

BACK
c) If today is not Sunday, then tomorrow is not Monday

p: Today is Sunday ¬p : Today is not Sunday

q: Tomorrow is Monday ¬q : Tomorrow is not Monday

Converse ¬p→¬q is ¬q→ ¬p, so the converse is

If tomorrow is not Monday, then today is not Sunday

BACK
d) If I am not lazy, then I come to the lecture

p: I am lazy ¬p : I am not lazy

q: I come to the lecture ¬q : I not come to the lecture

Converse ¬p→q is q→ ¬p, so the converse is

If I come to the lecture, then I am not lazy

BACK
Theorem: the following is a list of some common logical
equivalence rules:
1.1 𝑝∧𝑞 ≡𝑞∧𝑝 4.1 ¬ ¬𝑝 ≡ 𝑝
1.2 𝑝∨𝑞 ≡𝑞∨𝑝 4.2 ¬ 𝑝 ∧ 𝑞 ≡ ¬𝑝 ∨ ¬𝑞
4.3 ¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞
2.1 𝑝∧ 𝑞∧𝑟 ≡ 𝑝∧𝑞 ∧𝑟
2.2 𝑝 ∨ (𝑞 ∨ 𝑟) ≡ 𝑝 ∨ 𝑞 ∨ 𝑟 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
5.2 𝑝 ↔ 𝑞 ≡ ( 𝑝 → 𝑞) ∧ (𝑞 → 𝑝)
3.1 𝑝∧ 𝑞∨𝑟 ≡ 𝑝∧𝑞 ∨ 𝑝∧𝑟
3.2 𝑝 ∨ (𝑞 ∧ 𝑟) ≡ (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)
BACK
1.10 Prove by applying the above rules
a) ¬(𝑝 → 𝑞) ≡ 𝑝 ∧ ¬𝑞
b) 𝑝 → 𝑞 ≡ ¬𝑞 → ¬𝑝
c) 𝑝 → (𝑞 → 𝑟) ≡ 𝑞 → (𝑝 → 𝑟)
d) 𝑝 → (𝑞 ∧ 𝑟) ≡ (𝑝 → 𝑞) ∧ (𝑝 → 𝑟)
e) (𝑝 ∨ 𝑞) → 𝑟 ≡ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)

RULES

BACK NEXT
a) ¬ p → q ≡ p ∧ ¬q
¬ ¬𝑝 ∨ 𝑞 ≡ ¬ ¬𝑝 ∨ 𝑞
¬ ¬𝑝 ∧ ¬𝑞 ≡ ¬ ¬𝑝 ∧ ¬𝑞
𝑝 ∧ ¬𝑞 ≡ 𝑝 ∧ ¬𝑞

Rule 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
Rule 4.3 ¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞
Rule 4.1 ¬ ¬𝑝 ≡ 𝑝
Rule 4.3 ¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞 BACK
b) 𝑝 → 𝑞 ≡ ¬𝑞 → ¬𝑝
𝑝 → 𝑞 ≡ ¬(¬𝑞) ∨ ¬𝑝
𝑝 → 𝑞 ≡ 𝑞 ∨ ¬𝑝
𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
𝑝→𝑞≡𝑝→𝑞

Rule 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
Rule 4.1 ¬ ¬𝑝 ≡ 𝑝
Rule 1.2 𝑝∨𝑞 ≡𝑞∨𝑝
BACK
c) 𝑝→ (𝑞 → 𝑟) ≡ 𝑞 → (𝑝 → 𝑟)
𝑝→ (𝑞 → 𝑟) ≡ ¬𝑝 ∨ (𝑞 → 𝑟)
𝑝→ (𝑞 → 𝑟) ≡ ¬𝑝 ∨ ( ¬𝑞 ∨ 𝑟)
𝑝→ (𝑞 → 𝑟) ≡ (¬𝑝 ∨ ¬𝑞) ∨ 𝑟
𝑝→ (𝑞 → 𝑟) ≡ ¬𝑝 ∨ ¬𝑞 ∨ 𝑟
𝑝→ (𝑞 → 𝑟) ≡ ¬𝑝 ∨ (𝑞 → 𝑟)
𝑝→ (𝑞 → 𝑟) ≡ 𝑝 → (𝑞 → 𝑟)
Rule 1.2 𝑝∨𝑞 ≡𝑞∨𝑝
Rule 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
Rule 2.2 𝑝 ∨ (𝑞 ∨ 𝑟) ≡ 𝑝 ∨ 𝑞 ∨ 𝑟 BACK
d) 𝑝 → (𝑞 ∧ 𝑟) ≡ (𝑝 → 𝑞) ∧ (𝑝 → 𝑟)
𝑝 → (𝑞 ∧ 𝑟) ≡ ¬𝑝 ∨ (𝑞 ∧ 𝑟)
(𝑝 → 𝑞) ∧ (𝑝 → 𝑟) ≡ (¬𝑝 ∨ 𝑞) ∧ (¬𝑝 ∨ 𝑟)
𝑝→𝑞 ∧ 𝑝→𝑟 ≡ 𝑝→𝑞 ∧ 𝑝→𝑟

Rule 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
Rule 3.2 𝑝 ∨ (𝑞 ∧ 𝑟) ≡ (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)

BACK
e) (𝑝 ∨ 𝑞) → 𝑟 ≡ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)
(𝑝 ∨ 𝑞) → 𝑟 ≡ ¬(𝑝 ∨ 𝑞) ∨ 𝑟
(𝑝 → 𝑟) ∧ (𝑞 → 𝑟) ≡ (¬𝑝 ∧ ¬𝑞) ∨ 𝑟
(𝑝 → 𝑟) ∧ (𝑞 → 𝑟) ≡ ¬𝑝 ∨ 𝑟 ∧ ¬𝑞 ∨ 𝑟
(𝑝 → 𝑟) ∧ (𝑞 → 𝑟) ≡ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)

Rule 5.1 𝑝 → 𝑞 ≡ ¬𝑝 ∨ 𝑞
Rule 3.2 𝑝 ∨ (𝑞 ∧ 𝑟) ≡ (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)
Rule 4.3 ¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞
BACK
1.11 True or False. Prove by any method you like
a) 𝑝 → (𝑞 → 𝑟) ≡ (𝑝 → 𝑞) → 𝑟
b) 𝑝 → (𝑞 ∨ 𝑟) ≡ (𝑝 → 𝑞) ∨ (𝑝 → 𝑟)
c) 𝑝 ∧ (𝑞 → 𝑟) ≡ (𝑝 ∧ 𝑞) → (𝑝 ∧ 𝑟)
d) 𝑝 ∨ (𝑞 → 𝑟) ≡ (𝑝 ∨ 𝑞) → (𝑝 ∨ 𝑟)

BACK NEXT
 𝒑 𝒒 𝒓 𝒑∨𝒒 𝒑∨𝒓 𝒒∨𝒓 𝒑∧𝒒 𝒑∧𝒓 𝒑→𝒒 𝒒→𝒓 𝒑→𝒓

T T T T T T T T T T T

T T F T T T T F T F F

T F T T T T F T F T T

T F F T T F F F F T F

F T T T T T F F T T T

F T F T F T F F T F T

F F T F T T F F T T T

F F F F F F F F T T T
BACK
a) 𝑝 → (𝑞 → 𝑟) ≡ (𝑝 → 𝑞) → 𝑟
𝒑 𝒒 𝒓 𝒑→𝒒 𝒒→𝒓 𝒑 → (𝒒 → 𝒓) (𝒑 → 𝒒) → 𝒓
T T T T T T T
T T F T F F F
T F T F T T T
T F F F F T T
F T T T T T T
F T F T F T F
F F T T T T T
F F F T T T F

BACK
b) 𝑝 → (𝑞 ∨ 𝑟) ≡ (𝑝 → 𝑞) ∨ (𝑝 → 𝑟)
𝒑 𝒒 𝒓 𝒒∨𝒓 𝒑→𝒒 𝒑→𝒓 𝑝 → (𝑞 ∨ 𝑟) (𝑝 → 𝑞) ∨ (𝑝 → 𝑟)
T T T T T T T T
T T F T T F T T
T F T T F T T T
T F F F F F F F
F T T T T T T T
F T F T T T T T
F F T T T T T T
F F F F T T T T

BACK
c) 𝑝 ∧ (𝑞 → 𝑟) ≡ (𝑝 ∧ 𝑞) → (𝑝 ∧ 𝑟)
𝒑 𝒒 𝒓 𝒑∧𝒒 𝒑∧𝒓 𝒒→𝒓 𝑝 ∧ (𝑞 → 𝑟) (𝑝 ∧ 𝑞) → (𝑝 ∧ 𝑟)

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

BACK
d) 𝑝 ∨ (𝑞 → 𝑟) ≡ (𝑝 ∨ 𝑞) → (𝑝 ∨ 𝑟)
𝒑 𝒒 𝒓 𝒑∨𝒒 𝒑∨𝒓 𝒒→𝒓 𝑝 ∨ (𝑞 → 𝑟) (𝑝 ∨ 𝑞) → (𝑝 ∨ 𝑟)

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

BACK
A predicate is a proposional function such as 𝑃 𝑥 : 𝑥 + 2 = 5. The
statement “𝑥 + 2 = 5” by it self is not a proposition because it does not
have a truth value. But for each value of 𝑥. 𝑃(𝑥) becomes a proposition,
for instance, 𝑃 3 : 3 ÷ 2 = 5 is true and 𝑃 2 : 2 + 2 = 5 is false

1.12 Let 𝑃 𝑥 : 𝑥 2 < 𝑥

a) What is the value of 𝑃(1)?
b) What is the value of 𝑃(2)?
c) For which 𝑥 is the value of 𝑃(𝑥) true ?

BACK NEXT
 a) What is the value of 𝑃(1)?

𝑃 𝑥 : 𝑥2 < 𝑥
𝑃 1 ; (1)2 < 1
𝑃 1 ; 1<1

BACK
 b) What is the value of 𝑃(2)?

𝑃 𝑥 : 𝑥2 < 𝑥
𝑃 2 ; (2)2 < 2
𝑃 2 ;4 < 2

BACK
 c) For which 𝑥 is the value of 𝑃(𝑥) true ?

For decimal number.

𝑃 𝑥 : 𝑥2 < 𝑥
𝑃 0.1 ; (0.1)2 < 0.1
𝑃 0.1 ; 0.01 < 0.1

BACK
 THAT’S ALL

THANK YOU
Senin | 14 November 2016