Expresión (!a⇒b*c)+(!(b⇒a*c)⊕b)
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$\neg a \Rightarrow \left(b \wedge c\right) = a \vee \left(b \wedge c\right)$$
$$b \Rightarrow \left(a \wedge c\right) = \left(a \wedge c\right) \vee \neg b$$
$$b \not\Rightarrow \left(a \wedge c\right) = b \wedge \left(\neg a \vee \neg c\right)$$
$$b ⊕ b \not\Rightarrow \left(a \wedge c\right) = a \wedge b \wedge c$$
$$\left(\neg a \Rightarrow \left(b \wedge c\right)\right) \vee \left(b ⊕ b \not\Rightarrow \left(a \wedge c\right)\right) = a \vee \left(b \wedge c\right)$$
$$a \vee \left(b \wedge c\right)$$
Tabla de verdad
+---+---+---+--------+
| a | b | c | result |
+===+===+===+========+
| 0 | 0 | 0 | 0 |
+---+---+---+--------+
| 0 | 0 | 1 | 0 |
+---+---+---+--------+
| 0 | 1 | 0 | 0 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 1 |
+---+---+---+--------+
| 1 | 1 | 0 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 1 |
+---+---+---+--------+
Ya está reducido a FND
$$a \vee \left(b \wedge c\right)$$
$$\left(a \vee b\right) \wedge \left(a \vee c\right)$$
$$\left(a \vee b\right) \wedge \left(a \vee c\right)$$
$$a \vee \left(b \wedge c\right)$$