Sr Examen

Lang:

Lógica matemática/ abcd'

Expresión abcd'

El profesor se sorprenderá mucho al ver tu solución correcta😉

⌨

Solución

Ha introducido [src]

¬(a∧b∧c∧d)

$$\neg \left(a \wedge b \wedge c \wedge d\right)$$

Solución detallada

$$\neg \left(a \wedge b \wedge c \wedge d\right) = \neg a \vee \neg b \vee \neg c \vee \neg d$$

Simplificación [src]

$$\neg a \vee \neg b \vee \neg c \vee \neg d$$

(¬a)∨(¬b)∨(¬c)∨(¬d)

Tabla de verdad

+---+---+---+---+--------+
| a | b | c | d | result |
+===+===+===+===+========+
| 0 | 0 | 0 | 0 | 1      |
+---+---+---+---+--------+
| 0 | 0 | 0 | 1 | 1      |
+---+---+---+---+--------+
| 0 | 0 | 1 | 0 | 1      |
+---+---+---+---+--------+
| 0 | 0 | 1 | 1 | 1      |
+---+---+---+---+--------+
| 0 | 1 | 0 | 0 | 1      |
+---+---+---+---+--------+
| 0 | 1 | 0 | 1 | 1      |
+---+---+---+---+--------+
| 0 | 1 | 1 | 0 | 1      |
+---+---+---+---+--------+
| 0 | 1 | 1 | 1 | 1      |
+---+---+---+---+--------+
| 1 | 0 | 0 | 0 | 1      |
+---+---+---+---+--------+
| 1 | 0 | 0 | 1 | 1      |
+---+---+---+---+--------+
| 1 | 0 | 1 | 0 | 1      |
+---+---+---+---+--------+
| 1 | 0 | 1 | 1 | 1      |
+---+---+---+---+--------+
| 1 | 1 | 0 | 0 | 1      |
+---+---+---+---+--------+
| 1 | 1 | 0 | 1 | 1      |
+---+---+---+---+--------+
| 1 | 1 | 1 | 0 | 1      |
+---+---+---+---+--------+
| 1 | 1 | 1 | 1 | 0      |
+---+---+---+---+--------+

FNDP [src]

$$\neg a \vee \neg b \vee \neg c \vee \neg d$$

(¬a)∨(¬b)∨(¬c)∨(¬d)

FND [src]

Ya está reducido a FND

$$\neg a \vee \neg b \vee \neg c \vee \neg d$$

(¬a)∨(¬b)∨(¬c)∨(¬d)

FNCD [src]

$$\neg a \vee \neg b \vee \neg c \vee \neg d$$

(¬a)∨(¬b)∨(¬c)∨(¬d)

FNC [src]

Ya está reducido a FNC

$$\neg a \vee \neg b \vee \neg c \vee \neg d$$

(¬a)∨(¬b)∨(¬c)∨(¬d)