[SOLVED] COMPUTATIONAL-LOGIC - HOMEWORK 1

Description

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

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

1