RankRizz
JEE MAIN 2014 · 11 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

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

The proposition ∼(p∨∼q)∨∼(p∨q)\sim (p \vee \sim q) \vee \sim (p \vee q) is logically equivalent to:

SOLUTION

We start with the proposition: ∼(p∨∼q)∨∼(p∨q)\sim (p \vee \sim q) \vee \sim (p \vee q).

First, apply De Morgan's law to both parts. De Morgan's law states that ∼(A∨B)=(∼A)∧(∼B)\sim (A \vee B) = (\sim A) \wedge (\sim B).

For the left part: ∼(p∨∼q)\sim (p \vee \sim q). Here, A=pA = p and B=∼qB = \sim q, so:
∼(p∨∼q)=(∼p)∧∼(∼q)\sim (p \vee \sim q) = (\sim p) \wedge \sim(\sim q).
Since ∼(∼q)=q\sim(\sim q) = q, this simplifies to:
(∼p)∧q(\sim p) \wedge q.

For the right part: ∼(p∨q)\sim (p \vee q). Here, A=pA = p and B=qB = q, so:
∼(p∨q)=(∼p)∧(∼q)\sim (p \vee q) = (\sim p) \wedge (\sim q).

Now the expression becomes:
(∼p∧q)∨(∼p∧∼q)(\sim p \wedge q) \vee (\sim p \wedge \sim q).

Notice that ∼p\sim p is common in both terms. Factor out ∼p\sim p:
∼p∧(q∨∼q)\sim p \wedge (q \vee \sim q).

We know that q∨∼qq \vee \sim q is always true (tautology), because either qq is true or false. So:
q∨∼q=Trueq \vee \sim q = \text{True}.

Substitute this back:
∼p∧True\sim p \wedge \text{True}.

Any proposition AND True is the proposition itself. Therefore:
∼p∧True=∼p\sim p \wedge \text{True} = \sim p.

So, the original proposition simplifies to ∼p\sim p.

Comparing with the options:
A. p
B. q
C. ∼p\sim p
D. ∼q\sim q

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