Assuming binding priority (¬, ∧, ∨, →), how would you prove the validity of the sequents?
5. (p → r) ∨ (q → r) ⊢ (p ∧ q) → r
6. ¬(p ∨ q) is equivalent to (¬p ∧ ¬q) (prove → in both directions)
7. (p → ¬q) is equivalent to ¬(p ∧ q)
Get Answers For Free
Most questions answered within 1 hours.