RankRizz
JEE MAIN 2013 · 09 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

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

Statement-1: The statement A→(B→A)A \rightarrow (B \rightarrow A) is equivalent to A→(A∨B)A \rightarrow (A \vee B).
Statement-2: The statement ∼[(A∧B)→(∼A∨B)]\sim [(A \wedge B) \rightarrow (\sim A \vee B)] is a Tautology.

SOLUTION

We are given two statements and need to evaluate their truth values and the relationship between them. The options are based on whether each statement is true or false and if Statement-2 explains Statement-1.

First, we address Statement-1: The statement A→(B→A)A \rightarrow (B \rightarrow A) is equivalent to A→(A∨B)A \rightarrow (A \vee B). Two statements are equivalent if they have the same truth value for all possible truth values of their variables. We will use truth tables to verify this.

Construct a truth table for both expressions. Since there are two variables, A and B, there are four combinations of truth values.

For A→(B→A)A \rightarrow (B \rightarrow A):

  • Implication P→QP \rightarrow Q is false only when P is true and Q is false; otherwise, it is true.
  • B→AB \rightarrow A is equivalent to ¬B∨A\neg B \vee A.

For A→(A∨B)A \rightarrow (A \vee B):

  • A∨BA \vee B is false only when both A and B are false; otherwise, it is true.

The truth table is as follows:

A B B →\rightarrow A A ∨ B A →\rightarrow (B →\rightarrow A) A →\rightarrow (A ∨ B)
T T T →\rightarrow T = T T ∨ T = T T →\rightarrow T = T T →\rightarrow T = T
T F F →\rightarrow T = T T ∨ F = T T →\rightarrow T = T T →\rightarrow T = T
F T T →\rightarrow F = F F ∨ T = T F →\rightarrow F = T F →\rightarrow T = T
F F F →\rightarrow F = T F ∨ F = F F →\rightarrow T = T F →\rightarrow F = T

In all rows, both expressions evaluate to true. Therefore, A→(B→A)A \rightarrow (B \rightarrow A) and A→(A∨B)A \rightarrow (A \vee B) are both tautologies and hence equivalent. So, Statement-1 is true.

Now, we address Statement-2: The statement ∼[(A∧B)→(∼A∨B)]\sim [(A \wedge B) \rightarrow (\sim A \vee B)] is a tautology. A tautology is a statement that is always true, regardless of the truth values of its variables.

We simplify the given expression step by step:

  • Recall that P→QP \rightarrow Q is equivalent to ¬P∨Q\neg P \vee Q.
  • So, (A∧B)→(∼A∨B)(A \wedge B) \rightarrow (\sim A \vee B) is equivalent to ¬(A∧B)∨(∼A∨B)\neg (A \wedge B) \vee (\sim A \vee B).
  • The negation of the implication is ∼[(A∧B)→(∼A∨B)]=∼[¬(A∧B)∨(∼A∨B)]\sim [(A \wedge B) \rightarrow (\sim A \vee B)] = \sim [\neg (A \wedge B) \vee (\sim A \vee B)].
  • By De Morgan's law, ∼[¬(A∧B)∨(∼A∨B)]=(A∧B)∧∼(∼A∨B)\sim [\neg (A \wedge B) \vee (\sim A \vee B)] = (A \wedge B) \wedge \sim (\sim A \vee B).
  • Now, ∼(∼A∨B)=∼(∼A)∧∼B=A∧∼B\sim (\sim A \vee B) = \sim (\sim A) \wedge \sim B = A \wedge \sim B (by De Morgan's law).
  • So, the expression becomes (A∧B)∧(A∧∼B)(A \wedge B) \wedge (A \wedge \sim B).
  • Simplify: (A∧B)∧(A∧∼B)=A∧A∧B∧∼B=A∧(B∧∼B)=A∧false=false(A \wedge B) \wedge (A \wedge \sim B) = A \wedge A \wedge B \wedge \sim B = A \wedge (B \wedge \sim B) = A \wedge \text{false} = \text{false}.

The expression simplifies to false, which is a contradiction (always false). Therefore, it cannot be a tautology. So, Statement-2 is false.

We can also verify with a truth table:

A B A ∧ B ∼A ∼A ∨ B (A ∧ B) →\rightarrow (∼A ∨ B) ∼[(A ∧ B) →\rightarrow (∼A ∨ B)]
T T T F T T →\rightarrow T = T ∼T = F
T F F F F F →\rightarrow F = T ∼T = F
F T F T T F →\rightarrow T = T ∼T = F
F F F T T F →\rightarrow T = T ∼T = F

In every row, the expression ∼[(A∧B)→(∼A∨B)]\sim [(A \wedge B) \rightarrow (\sim A \vee B)] is false. Hence, it is a contradiction, not a tautology. Thus, Statement-2 is false.

Now, evaluating the options:

  • Option A: Statement-1 false; Statement-2 true →\rightarrow Incorrect, as Statement-1 is true and Statement-2 is false.
  • Option B: Both true; Statement-2 not correct explanation →\rightarrow Incorrect, as Statement-2 is false.
  • Option C: Statement-1 true; Statement-2 false →\rightarrow Correct.
  • Option D: Both true; Statement-2 correct explanation →\rightarrow Incorrect, as Statement-2 is false.

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