Sr Examen
Expresión NOTY&NOTP&NOT(X&Z)
El profesor se sorprenderá mucho al ver tu solución correcta😉
⌨
Solución
Ha introducido
[src]
(¬p)∧(¬y)∧(¬(x∧z))
$$\neg p \wedge \neg y \wedge \neg \left(x \wedge z\right)$$
Solución detallada
$$\neg \left(x \wedge z\right) = \neg x \vee \neg z$$
$$\neg p \wedge \neg y \wedge \neg \left(x \wedge z\right) = \neg p \wedge \neg y \wedge \left(\neg x \vee \neg z\right)$$
$$\neg p \wedge \neg y \wedge \neg \left(x \wedge z\right) = \neg p \wedge \neg y \wedge \left(\neg x \vee \neg z\right)$$
Simplificación
[src]
$$\neg p \wedge \neg y \wedge \left(\neg x \vee \neg z\right)$$
(¬p)∧(¬y)∧((¬x)∨(¬z))
Tabla de verdad
+---+---+---+---+--------+ | p | x | y | z | result | +===+===+===+===+========+ | 0 | 0 | 0 | 0 | 1 | +---+---+---+---+--------+ | 0 | 0 | 0 | 1 | 1 | +---+---+---+---+--------+ | 0 | 0 | 1 | 0 | 0 | +---+---+---+---+--------+ | 0 | 0 | 1 | 1 | 0 | +---+---+---+---+--------+ | 0 | 1 | 0 | 0 | 1 | +---+---+---+---+--------+ | 0 | 1 | 0 | 1 | 0 | +---+---+---+---+--------+ | 0 | 1 | 1 | 0 | 0 | +---+---+---+---+--------+ | 0 | 1 | 1 | 1 | 0 | +---+---+---+---+--------+ | 1 | 0 | 0 | 0 | 0 | +---+---+---+---+--------+ | 1 | 0 | 0 | 1 | 0 | +---+---+---+---+--------+ | 1 | 0 | 1 | 0 | 0 | +---+---+---+---+--------+ | 1 | 0 | 1 | 1 | 0 | +---+---+---+---+--------+ | 1 | 1 | 0 | 0 | 0 | +---+---+---+---+--------+ | 1 | 1 | 0 | 1 | 0 | +---+---+---+---+--------+ | 1 | 1 | 1 | 0 | 0 | +---+---+---+---+--------+ | 1 | 1 | 1 | 1 | 0 | +---+---+---+---+--------+
FND
[src]
$$\left(\neg p \wedge \neg x \wedge \neg y\right) \vee \left(\neg p \wedge \neg y \wedge \neg z\right)$$
((¬p)∧(¬x)∧(¬y))∨((¬p)∧(¬y)∧(¬z))
FNC
[src]
Ya está reducido a FNC
$$\neg p \wedge \neg y \wedge \left(\neg x \vee \neg z\right)$$
(¬p)∧(¬y)∧((¬x)∨(¬z))
FNDP
[src]
$$\left(\neg p \wedge \neg x \wedge \neg y\right) \vee \left(\neg p \wedge \neg y \wedge \neg z\right)$$
((¬p)∧(¬x)∧(¬y))∨((¬p)∧(¬y)∧(¬z))