RankRizz
JEE MAIN 2014 · 06 APR OFFLINE+4 / −1EASYTRANSCRIBED

JEE Main 2014 Mathematics question — Logical connectives, truth tables and tautologies

The statement ∼(p↔∼q)\sim(p \leftrightarrow \sim q) is:

SOLUTION

We have to examine the statement ∼ ⁣(p↔∼q)\sim\!\left(p \leftrightarrow \sim q\right) and decide which description among the four alternatives fits it.

First, recall the standard logical equivalence formula for a biconditional. We state it explicitly:

p↔r  ≡  (p∧r)  ∨  (∼p∧∼r).p \leftrightarrow r \;\equiv\; (p \wedge r)\;\vee\;(\sim p \wedge \sim r).

The symbol “≡\equiv” means “is logically equivalent to.” In our problem the role of rr is played by ∼q\sim q, so we substitute r=∼qr = \sim q:

p↔∼q  ≡  (p∧∼q)  ∨  (∼p∧∼(∼q)).p \leftrightarrow \sim q \;\equiv\; \bigl(p \wedge \sim q\bigr)\;\vee\;\bigl(\sim p \wedge \sim(\sim q)\bigr).

Because a double negation cancels, ∼(∼q)=q\sim(\sim q)=q. Substituting this, we simplify the right-hand side:

p↔∼q  ≡  (p∧∼q)  ∨  (∼p∧q).p \leftrightarrow \sim q \;\equiv\; \bigl(p \wedge \sim q\bigr)\;\vee\;\bigl(\sim p \wedge q\bigr).

Now our original expression contains the negation of this whole biconditional, so we negate what we have just obtained:

∼ ⁣(p↔∼q)  ≡  ∼ ⁣[ (p∧∼q)  ∨  (∼p∧q)].\sim\!\left(p \leftrightarrow \sim q\right) \;\equiv\; \sim\!\Bigl[\, \bigl(p \wedge \sim q\bigr)\;\vee\;\bigl(\sim p \wedge q\bigr)\Bigr].

Next we invoke De Morgan’s law, which states

∼(A∨B)  ≡  (∼A)∧(∼B).\sim(A \vee B) \;\equiv\; (\sim A) \wedge (\sim B).

Identifying A=(p∧∼q)A = (p \wedge \sim q) and B=(∼p∧q)B = (\sim p \wedge q), we apply the law:

∼ ⁣(p↔∼q)  ≡  (∼(p∧∼q))  ∧  (∼(∼p∧q)).\sim\!\left(p \leftrightarrow \sim q\right) \;\equiv\; \bigl(\sim(p \wedge \sim q)\bigr)\;\wedge\;\bigl(\sim(\sim p \wedge q)\bigr).

Each of the two negations inside the brackets can again be opened with De Morgan’s law, this time in its conjunctive form

∼(X∧Y)  ≡  (∼X)∨(∼Y).\sim(X \wedge Y) \;\equiv\; (\sim X) \vee (\sim Y).

For the first bracket we have X=pX=p and Y=∼qY=\sim q, giving

∼(p∧∼q)  ≡  (∼p)∨(∼(∼q)).\sim(p \wedge \sim q) \;\equiv\; (\sim p) \vee \bigl(\sim(\sim q)\bigr).

The double negation ∼(∼q)\sim(\sim q) collapses to qq, so the first bracket becomes

∼(p∧∼q)  ≡  (∼p)∨q.\sim(p \wedge \sim q) \;\equiv\; (\sim p) \vee q.

For the second bracket we have X=∼pX=\sim p and Y=qY=q, yielding

∼(∼p∧q)  ≡  (∼(∼p))∨(∼q).\sim(\sim p \wedge q) \;\equiv\; \bigl(\sim(\sim p)\bigr) \vee (\sim q).

Again the double negation ∼(∼p)\sim(\sim p) reduces to pp, giving

∼(∼p∧q)  ≡  p∨(∼q).\sim(\sim p \wedge q) \;\equiv\; p \vee (\sim q).

Collecting both results, we have transformed the original statement into

∼ ⁣(p↔∼q)  ≡  ((∼p)∨q)  ∧  (p∨(∼q)).\sim\!\left(p \leftrightarrow \sim q\right) \;\equiv\; \bigl((\sim p) \vee q\bigr)\;\wedge\;\bigl(p \vee (\sim q)\bigr).

Thus

  ∼ ⁣(p↔∼q)  ≡  (∼p∨q)  ∧  (p∨∼q)  \boxed{\; \sim\!\left(p \leftrightarrow \sim q\right) \;\equiv\; (\sim p \vee q)\;\wedge\;(p \vee \sim q) \;}

We now show that the right-hand side is exactly p↔qp \leftrightarrow q. To see this, we once more recall the biconditional formula, this time with r=qr=q:

p↔q  ≡  (p∧q)  ∨  (∼p∧∼q).p \leftrightarrow q \;\equiv\; (p \wedge q)\;\vee\;(\sim p \wedge \sim q).

One way to verify equivalence of two compound statements is to check that their truth tables match. Below are the four possible truth-value assignments for pp and qq, and the resulting truth values of (∼p∨q)∧(p∨∼q)(\sim p \vee q)\wedge(p \vee \sim q):

pq∼p∨qp∨∼qConjunctionTTTTTTFFTFFTTFFFFTTT\begin{array}{c|c||c|c|c} p & q & \sim p \vee q & p \vee \sim q & \text{Conjunction} \\ \hline T & T & T & T & T\\ T & F & F & T & F\\ F & T & T & F & F\\ F & F & T & T & T \end{array}

The last column reads T, F, F, T—precisely the truth pattern of p↔qp \leftrightarrow q. Hence

(∼p∨q)  ∧  (p∨∼q)  ≡  p↔q.(\sim p \vee q)\;\wedge\;(p \vee \sim q) \;\equiv\; p \leftrightarrow q.

Combining this with the boxed equivalence obtained earlier, we finally deduce

  ∼ ⁣(p↔∼q)  ≡  p↔q  \boxed{\; \sim\!\left(p \leftrightarrow \sim q\right) \;\equiv\; p \leftrightarrow q \;}

This matches Option C in the given list. It is therefore neither a tautology nor a fallacy in isolation; it is simply equivalent to another specific biconditional.

Hence, the correct answer is Option C.

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice