Assume that all of the following are true(P ∨ Q) ⇒ RQ ∨ RR ⇒ PShow by contradiction that P is true.3
Question
Assume that all of the following are true(P ∨ Q) ⇒ RQ ∨ RR ⇒ PShow by contradiction that P is true.3
Solution
To prove P by contradiction, we first assume that P is not true.
- Assume ~P (P is not true)
- From the first statement, (P ∨ Q) ⇒ R, since we assumed ~P, we have Q ⇒ R (because if P is not true in a disjunction, the other must be true for the disjunction to hold)
- From the second statement, Q ∨ R ⇒ P, but we assumed ~P, so we must have ~Q and ~R (because if P is not true in a disjunction, the other must be false for the disjunction to hold)
- But from step 2, we have Q ⇒ R, which contradicts with ~Q and ~R from step 3.
Therefore, our assumption that ~P is false, which means P must be true.
Similar Questions
Truth Tables for:1. ~ p ∧ q2. ~ p ∧ (q ∨ ~ r)3. (p∨q) ∧ ~ (p∧q)
Which of the following is a contradiction?(p∧q)∧~(p∨q)p∨(~p∧q)(p⇒q)⇒pNone of these
If p is true, q is false, and r is true, what is the truth value of r∨(q∧~p)?truefalsecannot be determinedSubmit
From the premises ¬¬P ∨ Q, P ↔ R, and H → ¬Q derive H → P using the inference rules and equivalence lawsfrom the lectures. Start with the premises and state in each step which rule you are using. Following from this, Let¬¬P ∨ Q be true and H → ¬Q be true. Prove that H → P is true by contradiction
State whether each of the following propositions is a tautology or a contradiction or contingent (i.e. neither).You must give a (brief) reason to justify each of your answers.(a) P(b) (P ∧ Q) → (P → Q)(c) ¬(P → Q) → (¬Q)(d) (¬Q ∧ (P → Q)) → ¬P(e) ((P → Q) ∧ (Q → R)) ↔ (P → R)(f) (R ∨ P ) → (P ∨ (Q ∨ R))
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.