Question

Prove $\neg O$, assuming the following assumptions are true. Give a proof by contradiction. (1) $O \to (\neg M \land \neg V)$ (2) $G \to V$ (3) $\neg M \to G$

          Prove $\neg O$, assuming the following assumptions are true. Give a proof by contradiction.
(1) $O \to (\neg M \land \neg V)$
(2) $G \to V$
(3) $\neg M \to G$

Prove O, assuming the following assumptions are true. Give a proof by contradiction.
(1) O → ( M V)
(2) G → V
(3) M → G

Added by Dana P.

Discrete Mathematics and its Applications

Kenneth Rosen 8th Edition

Chapter 1

Instant Answer

Solved by Expert Hunza Gilgit

Step 1

Assume O. From assumption (1), we have O → (¬M ∧ ¬V). Since we assumed O, we can use modus ponens to conclude ¬M ∧ ¬V. From assumption (2), we have G ∧ V. From assumption (3), we have ¬M ∧ G. From ¬M ∧ G, we can conclude G. From G ∧ V, we can conclude Show more…

Show all steps