Key Concepts and Formulas
- Implication (→): A→B is false only when A is true and B is false. Otherwise, it is true.
- Conjunction (∧): A∧B is true only when both A and B are true. Otherwise, it is false.
- Disjunction (∨): A∨B is false only when both A and B are false. Otherwise, it is true.
- Negation (∼): If A is true, then ∼A is false, and if A is false, then ∼A is true.
Step-by-Step Solution
Step 1: Analyze the given statement.
We are given that (p∧∼q)∧(p∧r)→∼p∨q is false. Using the truth table properties of implication, the only way an implication A→B can be false is when A is true and B is false. Therefore, we must have:
(p∧∼q)∧(p∧r) is True, and ∼p∨q is False.
Step 2: Determine the truth values of ∼p and q.
Since ∼p∨q is false, both ∼p and q must be false.
∼p=False and q=False.
Step 3: Determine the truth value of p.
Since ∼p is false, p must be true.
p=True.
Step 4: Determine the truth value of ∼q.
Since q is false, ∼q must be true.
∼q=True.
Step 5: Analyze the truth values of p∧∼q and p∧r.
Since (p∧∼q)∧(p∧r) is true, both p∧∼q and p∧r must be true.
p∧∼q=True and p∧r=True.
Step 6: Determine the truth value of r.
We know p=True, and p∧r=True. Therefore, r must be true.
r=True.
Step 7: Summarize the truth values.
We have found that p=True, q=False, and r=True.
Step 8: Check if the solution matches the given correct answer.
The truth values we found are p=T,q=F,r=T. The given correct answer is (A) F, T, F. However, we derived T, F, T. There seems to be a mistake in the provided correct answer. Let's re-evaluate the given options.
If p=F,q=T,r=F (option A), then ∼q=F, so p∧∼q=F∧F=F. Therefore (p∧∼q)∧(p∧r)=F∧(F∧F)=F. Also, ∼p∨q=T∨T=T. So, (p∧∼q)∧(p∧r)→∼p∨q becomes F→T which is True.
If p=T,q=F,r=T (option B), then ∼q=T, so p∧∼q=T∧T=T. Therefore (p∧∼q)∧(p∧r)=T∧(T∧T)=T. Also, ∼p∨q=F∨F=F. So, (p∧∼q)∧(p∧r)→∼p∨q becomes T→F which is False.
If p=T,q=T,r=T (option C), then ∼q=F, so p∧∼q=T∧F=F. Therefore (p∧∼q)∧(p∧r)=F∧(T∧T)=F. Also, ∼p∨q=F∨T=T. So, (p∧∼q)∧(p∧r)→∼p∨q becomes F→T which is True.
If p=F,q=F,r=F (option D), then ∼q=T, so p∧∼q=F∧T=F. Therefore (p∧∼q)∧(p∧r)=F∧(F∧F)=F. Also, ∼p∨q=T∨F=T. So, (p∧∼q)∧(p∧r)→∼p∨q becomes F→T which is True.
The only option that makes the given statement false is option B.
Common Mistakes & Tips
- Remember the truth tables for each logical operator (∧, ∨, ∼, →).
- The implication A→B is only false when A is true and B is false.
- Work systematically and break down the complex statement into smaller parts.
Summary
We are given that (p∧∼q)∧(p∧r)→∼p∨q is false. This means that (p∧∼q)∧(p∧r) is true and ∼p∨q is false. From the second part, we deduce that ∼p is false and q is false, which means p is true. From the first part, since p is true and p∧∼q must be true, then ∼q must be true, which is consistent with q being false. Since p is true and p∧r is true, r must be true. Therefore, p=T,q=F,r=T. This corresponds to option (B). The given correct answer (A) is incorrect.
Final Answer
The final answer is \boxed{T, F, T}, which corresponds to option (B).