COMPUTATIONAL LOGIC-HOMEWORK 1 SOLVED

INTRODUCTION TO COMPUTATIONAL LOGIC

(1)   Show p =⇒ q,r =⇒ s ` p ∧ r =⇒ q ∧ s is valid.

(2)   Show (p ∧ q) ∨ (p ∧ r) ` p ∧ (q ∨ r) is valid.

(3)   Show p ∧ q =⇒ r ` (p =⇒ r) ∨ (q =⇒ r) is valid.

(4)   Show p =⇒ q `¬p ∨ q is valid.

(5)   Show ` (p =⇒ q) ∨ (q =⇒ r) is valid.

1