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

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

The Boolean expression ∼(p⇒(∼q))\sim(p \Rightarrow (\sim q)) is equivalent to

SOLUTION

We have to simplify the Boolean expression ∼ ⁣(p⇒(∼q))\sim\!\bigl(p \Rightarrow (\sim q)\bigr) and write the result in one of the listed equivalent forms.

First, we recall the logical equivalence that defines an implication. The implication a⇒ba \Rightarrow b is always equivalent to the disjunction (∼a) ∨ b.(\sim a)\,\vee\, b. We will apply this fact to the inner implication p⇒(∼q).p \Rightarrow (\sim q).

So we write

p⇒(∼q)  =  (∼p) ∨ (∼q).p \Rightarrow (\sim q) \;=\; (\sim p)\,\vee\,(\sim q).

Substituting this back into the original expression gives

∼ ⁣(p⇒(∼q))  =  ∼ ⁣((∼p) ∨ (∼q)).\sim\!\bigl(p \Rightarrow (\sim q)\bigr) \;=\; \sim\!\bigl((\sim p)\,\vee\,(\sim q)\bigr).

Now we must remove the outer negation. For this we make use of De Morgan’s Law, which states:

∼(A∨B)=(∼A)∧(∼B),∼(A∧B)=(∼A)∨(∼B).\sim(A \vee B) = (\sim A) \wedge (\sim B), \quad \sim(A \wedge B) = (\sim A) \vee (\sim B).

In our case A=(∼p)andB=(∼q).A = (\sim p)\quad\text{and}\quad B = (\sim q). Hence

∼ ⁣((∼p) ∨ (∼q))=(∼(∼p)) ∧ (∼(∼q)).\sim\!\bigl((\sim p)\,\vee\,(\sim q)\bigr) = (\sim(\sim p)) \,\wedge\, (\sim(\sim q)).

Double negations cancel out, because ∼(∼r)=r\sim(\sim r)=r for any statement rr. Therefore

(∼(∼p)) ∧ (∼(∼q))=p ∧ q.(\sim(\sim p)) \,\wedge\, (\sim(\sim q)) = p \,\wedge\, q.

Thus we have shown step by step that

∼ ⁣(p⇒(∼q))=p∧q.\sim\!\bigl(p \Rightarrow (\sim q)\bigr) = p \wedge q.

The equivalent option in the list is Option D.

Hence, the correct answer is Option D.

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