Sr Examen

Expresión a∧¬(¬c∨¬b)∨¬(¬a∧b)∧c∨a∧c

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

    Solución

    Ha introducido [src]
    (a∧c)∨(c∧(¬(b∧(¬a))))∨(a∧(¬((¬b)∨(¬c))))
    $$\left(a \wedge c\right) \vee \left(a \wedge \neg \left(\neg b \vee \neg c\right)\right) \vee \left(c \wedge \neg \left(b \wedge \neg a\right)\right)$$
    Solución detallada
    $$\neg \left(b \wedge \neg a\right) = a \vee \neg b$$
    $$c \wedge \neg \left(b \wedge \neg a\right) = c \wedge \left(a \vee \neg b\right)$$
    $$\neg \left(\neg b \vee \neg c\right) = b \wedge c$$
    $$a \wedge \neg \left(\neg b \vee \neg c\right) = a \wedge b \wedge c$$
    $$\left(a \wedge c\right) \vee \left(a \wedge \neg \left(\neg b \vee \neg c\right)\right) \vee \left(c \wedge \neg \left(b \wedge \neg a\right)\right) = c \wedge \left(a \vee \neg b\right)$$
    Simplificación [src]
    $$c \wedge \left(a \vee \neg b\right)$$
    c∧(a∨(¬b))
    Tabla de verdad
    +---+---+---+--------+
    | a | b | c | result |
    +===+===+===+========+
    | 0 | 0 | 0 | 0      |
    +---+---+---+--------+
    | 0 | 0 | 1 | 1      |
    +---+---+---+--------+
    | 0 | 1 | 0 | 0      |
    +---+---+---+--------+
    | 0 | 1 | 1 | 0      |
    +---+---+---+--------+
    | 1 | 0 | 0 | 0      |
    +---+---+---+--------+
    | 1 | 0 | 1 | 1      |
    +---+---+---+--------+
    | 1 | 1 | 0 | 0      |
    +---+---+---+--------+
    | 1 | 1 | 1 | 1      |
    +---+---+---+--------+
    FNDP [src]
    $$\left(a \wedge c\right) \vee \left(c \wedge \neg b\right)$$
    (a∧c)∨(c∧(¬b))
    FND [src]
    $$\left(a \wedge c\right) \vee \left(c \wedge \neg b\right)$$
    (a∧c)∨(c∧(¬b))
    FNC [src]
    Ya está reducido a FNC
    $$c \wedge \left(a \vee \neg b\right)$$
    c∧(a∨(¬b))
    FNCD [src]
    $$c \wedge \left(a \vee \neg b\right)$$
    c∧(a∨(¬b))