RankRizz
JEE MAIN 2019 · 12 JAN S2+4 / −1EASYTRANSCRIBED

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

The expression ∼(∼p→q)\sim(\sim p \to q) is logically equivalent to

SOLUTION

We begin with the expression ∼(∼p→q)\sim(\sim p \to q) and shall simplify it carefully, showing every algebraic detail.

First, we recall the implication law:

x→y  ≡  ∼x  ∨  y.x \to y \;\equiv\; \sim x \;\vee\; y.

Here the part playing the role of xx is ∼p\sim p and the part playing the role of yy is qq. Substituting these symbols into the implication law we obtain

( ∼p→q )  ≡  ∼( ∼p )  ∨  q.\bigl(\,\sim p \to q\,\bigr) \;\equiv\; \sim(\,\sim p\,)\;\vee\;q.

Now, inside the negation we have a double negation ∼( ∼p )\sim(\,\sim p\,), and the rule of double negation states that ∼( ∼p )≡p\sim(\,\sim p\,)\equiv p. Hence we get

( ∼p→q )  ≡  p  ∨  q.\bigl(\,\sim p \to q\,\bigr) \;\equiv\; p \;\vee\; q.

Returning to the original expression, we must negate this result. So we write

∼( ∼p→q )  ≡  ∼(p  ∨  q).\sim(\,\sim p \to q\,) \;\equiv\; \sim\bigl(p \;\vee\; q\bigr).

Next, we invoke De Morgan’s law, which tells us that the negation of a disjunction is the conjunction of the negations:

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

Thus, after carrying out all transformations, the original expression simplifies completely to

∼p  ∧  ∼q.\sim p \;\wedge\; \sim q.

Looking at the options, this matches Option B.

Hence, the correct answer is Option B.

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