Question:

The proposition \((p \rightarrow \neg p) \wedge (\neg p \rightarrow p)\) is

Show Hint

\(p \rightarrow q\) is logically equivalent to \(\neg p \vee q\).
Updated On: Apr 20, 2026
  • a tautology
  • a contradiction
  • neither tautology nor contradiction
  • both tautology and contradiction
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

To determine whether the proposition \((p \rightarrow \neg p) \wedge (\neg p \rightarrow p)\) is a tautology, contradiction, or neither, let's analyze it step-by-step using a truth table.

The proposition involves two sub-expressions: 

  • \(p \rightarrow \neg p\): This is known as the implication which is equivalent to \(\neg p \lor \neg p\).
  • \(\neg p \rightarrow p\): This is also an implication which is equivalent to \(p \lor p\).

We determine the truth values of these sub-expressions for all possible values of \(p\):

\(p\)\(\neg p\)\(p \rightarrow \neg p\)\(\neg p \rightarrow p\)\((p \rightarrow \neg p) \wedge (\neg p \rightarrow p)\)
TFFTF
FTTFF

From the truth table, we can observe:

  • When \(p\) is True, the entire proposition \((p \rightarrow \neg p) \wedge (\neg p \rightarrow p)\) is False.
  • When \(p\) is False, the entire proposition \((p \rightarrow \neg p) \wedge (\neg p \rightarrow p)\) is also False.

Since the final column of the truth table indicates that the proposition is False for all possible truth values of \(p\), the proposition is a contradiction. A contradiction is a statement that is always false, regardless of the truth values of its components.

Thus, the correct answer is: the proposition is a contradiction.

Was this answer helpful?
0
0