edited by
12,019 views
47 votes
47 votes

Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always

  1. True
  2. False
  3. Same as the truth-value of $b$
  4. Same as the truth-value of $d$
edited by

7 Answers

Best answer
55 votes
55 votes

Given  that $\ a\Leftrightarrow (b\vee \neg b)$ and $ b\Leftrightarrow c$
Now,
$(a\wedge b)\rightarrow (a \wedge c)\vee d$
$\equiv (a\wedge b)\rightarrow (a \wedge b)\vee d\;\;\;\; (\because b \Leftrightarrow c)$
$\equiv \neg (a\wedge b)\vee (a \wedge b)\vee d$
$\equiv T \vee d$
$\equiv T$
Hence, Option(A) True.

edited by
49 votes
49 votes

Given that, a\Leftrightarrowb∨~b

It is equivalent to a\LeftrightarrowTRUE

\therefore (a∧b)\rightarrow((a∧c)∨d)

wkt, 1∧x = x

\therefore (a∧b) = 1∧b = b

similarly, 1∧c = c

We now have, b \rightarrow(c∨d)

Which can be written as,

~b∨c∨d

We also know that b\Leftrightarrowc

\therefore ~b∨c = TRUE

\therefore TRUE∨d = TRUE

And hence answer is option a

16 votes
16 votes
a ⇔ ( b V ~b) = and a ⇔  True means both a and True are equivalent
 b ⇔c means both b and c are equivalent

(a ∧ b) → (a ∧ c) ∨ d
=(True ∧ b) → (True ∧ c) ∨ d     (a ⇔  True)
= b → c ∨ d
= ~b ∨ c ∨ d
= ~b ∨ b ∨ d     (b ⇔c)
= True  ∨ d
=True

Hence ans is A
edited by
Answer:

Related questions