Question
Question: Which of the following is correct? A. \((p \vee q) \equiv (p \wedge q)\) B. \((p \to q) \equiv (...
Which of the following is correct?
A. (p∨q)≡(p∧q)
B. (p→q)≡(q→p)
C. (p→q)≡(p∧q)
D. None of these
Solution
These questions can be solved by understanding the meaning and implications of the logical connectives like ∧ , ∨ or → . Further, a truth table can be drawn for the given compound statements, and then each option can be evaluated and checked.
Complete step-by-step solution:
First, draw the truth table for each of the given compound statements in the question.
Truth Table for (p∨q) :
p | q | (p∨q) |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
(p∨q) is true when either p is true or q is true or both are true. It is only false if both are false, simultaneously.
Truth Table for (p∧q) :
p | q | (p∧q) |
---|---|---|
T | T | T |
T | F | F |
F | T | F |
F | F | F |
(p∧q) is true only when both, p and q are true, otherwise, it is always false.
Truth Table for (p→q) :
p | q | (p→q) |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
(p→q) is true if the condition while implying q is true, otherwise, the output will be false. This is a two-valued logic.
Truth Table for (q→p) :
q | p | (q→p) |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
The same conditions are true for (q→p) logical statements, which are true for (p→q) logical statements.
Now, compare all the truth tables one by one according to the options given in the question.
Comparing all the truth tables, it is clear that the truth table for the logical statement (p→q) is equivalent to the truth table for the logical statement (q→p) .
Hence, the correct answer out of the given options is B. (p→q)≡(q→p).
Note: Always be careful while writing the truth tables for logical statements like, (p∧q) and (p∨q). Also, remember to carefully check each and every condition of the two truth tables sequentially to prove them equivalent to each other.