JEE Main 2009 Mathematics question — Logical connectives, truth tables and tautologies
Statement-1: ∼(p↔∼q) is equivalent to p↔q. Statement-2: ∼(p↔∼q) is a tautology.
SOLUTION
Key idea:∼(p↔r)≡p↔∼r.
∼(p↔∼q)≡p↔∼(∼q)≡p↔q. Check with a truth table: when p,q have the same truth value, p↔∼q is F, so its negation is T, exactly like p↔q. So Statement-1 is true.
p↔q is false when p= T and q= F, so ∼(p↔∼q) is not a tautology. Statement-2 is false.
Answer: (C)
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.