Modus ponens

From Wikiversity
Jump to navigation Jump to search

5. a. Prove that modus ponens is sound for propositional calculus. Hint: use truth tables to enumerate all possible interpretations. b. Abduction is an inference rule that infers P from P→Q and Q. Show that abduction is not sound c. Show modus tollens ((P→Q) ∧ ¬ Q)→¬ P is sound.