Sr Examen

Expresión Bx(A\C)=(BxA)A(Bx(A&C))

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

    Solución

    Ha introducido [src]
    (a∧b∧c∧x)⇔(b∧x∧(a|c))
    $$\left(b \wedge x \wedge \left(a | c\right)\right) ⇔ \left(a \wedge b \wedge c \wedge x\right)$$

    Вы использовали:
    | - Не-и (штрих Шеффера).
    Возможно вы имели ввиду символ - Дизъюнкция (ИЛИ)?
    Посмотреть с символом ∨
    Solución detallada
    $$a | c = \neg a \vee \neg c$$
    $$b \wedge x \wedge \left(a | c\right) = b \wedge x \wedge \left(\neg a \vee \neg c\right)$$
    $$\left(b \wedge x \wedge \left(a | c\right)\right) ⇔ \left(a \wedge b \wedge c \wedge x\right) = \neg b \vee \neg x$$
    Simplificación [src]
    $$\neg b \vee \neg x$$
    (¬b)∨(¬x)
    Tabla de verdad
    +---+---+---+---+--------+
    | a | b | c | x | 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 | 0      |
    +---+---+---+---+--------+
    | 0 | 1 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 0 | 1 | 1 | 1 | 0      |
    +---+---+---+---+--------+
    | 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 | 0      |
    +---+---+---+---+--------+
    | 1 | 1 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 1 | 1 | 1 | 1 | 0      |
    +---+---+---+---+--------+
    FNDP [src]
    $$\neg b \vee \neg x$$
    (¬b)∨(¬x)
    FNCD [src]
    $$\neg b \vee \neg x$$
    (¬b)∨(¬x)
    FNC [src]
    Ya está reducido a FNC
    $$\neg b \vee \neg x$$
    (¬b)∨(¬x)
    FND [src]
    Ya está reducido a FND
    $$\neg b \vee \neg x$$
    (¬b)∨(¬x)