(a) Use rules of inference and laws of logical equivalence (given in Tables 7.6–7.8 in the Unit Notes) to prove the following:
(p → q) ∧ (r → s) ∧ [t → ⇁(q ∨ s)] ∧ t) ⇒ (⇁p ∧ ⇁r)
(b) Use the MATLAB program truth.m and a modified version of propos.m to verify the validity of the inference in part (a).
Comments
Leave a comment