Logical equivalence implication forms – UGC NET Question

A is correct because logical equivalence is defined via matching truth values in all cases. B is true as p → q is truth-functionally the same as ¬p ∨ q. D is correct since a conditional and its contrapositive always share the same truth table. C is wrong because p → q and q → p are converses and need not share truth values, and E is wrong since equivalence is about truth conditions, not syntactic identity. Therefore, C and E only are the wrong statements.

Option A:
Option A is correct because it identifies exactly C and E as the problematic statements, leaving intact the proper definitions and equivalences in A, B and D. It aligns with standard logical theory taught for NET.

Option B:
Option B considers only C as wrong and mistakenly treats E as acceptable, despite E conflating syntactic form with semantic equivalence. It therefore misses one incorrect statement.

Option C:
Option C treats only E as wrong and ignores the clear counterexamples to C where p → q and q → p differ, so it does not cover all wrong statements.

Option D:
Option D includes D among wrong statements, even though D is correct about contrapositive equivalence, and so misclassifies a true principle along with the false ones.