0
$\begingroup$

Let $a,b$ be logic propositions. In the truth table for $a,b$ whenever $a=T$ then $b=F$ and when $b=F$ then $a=T$. Which of the below statements is true:

  1. $a\to b$ is a tautology

  2. $a\to b$ is a contradiction

  3. $a \lor b$ is a contradiction

  4. $a \iff b$ is a contradiction

  5. none of the statements are correct

I think that 4) is correct that is $a \iff b$ is a contradiction because of the given that $a$ and $b$ are always the opposite of each other and $\iff$ requires both sides to be true.

But I'm not sure.

$\endgroup$
  • 1
    $\begingroup$ Yes: $(a \leftrightarrow \lnot b)$ is equiv to $\lnot (a \leftrightarrow b)$. $\endgroup$ – Mauro ALLEGRANZA Jun 12 '18 at 15:38
  • 1
    $\begingroup$ If you write the statements with logic symbols, maybe it's clearer: the statements you made are that $(a \rightarrow \neg b) \wedge (\neg b \rightarrow a)$, which means that... EDIT: exactly what @MauroALLEGRANZA wrote :) $\endgroup$ – Riccardo Sven Risuleo Jun 12 '18 at 15:38
  • $\begingroup$ You wrote "⟺ requires both sides to be true" which is false. Equivalence does not mean both sides must be true. $\endgroup$ – user21820 Jun 16 '18 at 8:11
1
$\begingroup$

2) is true, since $a \to b$ holds iff $a = F$ or $b = T$, neither of which is the case.

1) is false by the same reasoning as above.

3) is false, since $a \vee b$ holds iff $a = T$ or $b = T$.

4) is true, since $a \to b$ is a contradiction, as just mentioned. But $a \leftrightarrow b$ is an even stronger statement, so it is also a contradiction.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.