Saltar al contenido

El error de De Morgan: NOT (A AND B) frente a NOT A AND NOT B

NOT (A AND B) frente al error NOT A AND NOT B. La comprobación de equivalencia falla con el contraejemplo A = FALSO, B = VERDADERO, y la tabla marca las dos filas en las que «no ambos» y «ninguno» discrepan.

La fórmula correcta, NOT (A AND B), es «no ambos»: falla solo cuando A y B son los dos verdaderos. El error empuja la negación a cada entrada pero olvida convertir el AND en OR, y da NOT A AND NOT B, que es «ninguno»: se cumple solo cuando los dos son falsos. La lectura del motor de la fórmula correcta dice que es verdadera exactamente cuando no se cumple la condición «A y B son ambos verdaderos». En la tabla la columna correcta es verdadera en tres filas, Σm(0, 1, 2); el error lo es en una, la fila 0.

La equivalencia se viola e informa del contraejemplo A = FALSO, B = VERDADERO: la fórmula correcta es verdadera, el error es falso. Difieren las filas 1 y 2, A = FALSO, B = VERDADERO y A = VERDADERO, B = FALSO; coinciden en las filas 0 y 3. El resto coincide con la página del ejemplo de De Morgan: no es tautología, contraejemplo A = VERDADERO, B = VERDADERO; satisfacible, testigo A = FALSO, B = FALSO; ninguna ley de simplificación se aplica; la FNC y la FND son NOT A OR NOT B tras un paso de De Morgan.

Este error es el fallo de negación más común en reglas y en código, y también es fácil cometerlo en prosa: «los usuarios no pueden estar a la vez suspendidos y sin verificar» no es «ni lo uno ni lo otro». Las dos filas que difieren son los casos de prueba que lo destapan, una entrada verdadera y la otra falsa. Lo que hay que vigilar es que el error es más estricto, no más laxo: rechaza dos filas que la regla acepta, así que suele aflorar como la queja de un usuario bloqueado y no como un agujero de seguridad, y sobrevive mucho tiempo.

correct := NOT (A AND B) · salidaslip := NOT A AND NOT B · salida

Comprobaciones exactas

¿Siempre verdadera (tautología)? No Contraejemplo: A = V, B = V · Exhaustively checked and solver cross-checked · 4 filas
¿Siempre falsa (contradicción)? No Contraejemplo: A = F, B = F · Exhaustively checked and solver cross-checked · 1 filas
¿Puede ser verdadera? Sí Asignación de ejemplo: A = F, B = F · Exhaustively checked and solver cross-checked · 1 filas
¿Son equivalentes correct y slip? No Contraejemplo: A = F, B = V · Exhaustively checked and solver cross-checked · 2 filas

Tabla de verdad (4 filas)

El error de De Morgan: NOT (A AND B) frente a NOT A AND NOT B
#ABcorrectslip
0FALSOFALSOVERDADEROVERDADERO
1FALSOVERDADEROVERDADEROFALSO
2VERDADEROFALSOVERDADEROFALSO
3VERDADEROVERDADEROFALSOFALSO

Lectura en lenguaje claro

Principiantecorrect es verdadero exactamente cuando no se cumple la condición siguiente:
1. A y B son ambos verdaderos
En todos los demás casos, correct es falso.
Sobre los operadores:
- NOT (NO) invierte un valor: lo verdadero pasa a ser falso y lo falso, verdadero.
- AND (Y) solo es verdadero cuando todas sus partes son verdaderas.
Intermediocorrect es verdadero exactamente cuando no se cumple la condición siguiente:
1. A y B son ambos verdaderos
En todos los demás casos, correct es falso.
Avanzadocorrect es verdadero exactamente cuando no se cumple la condición siguiente [negación ¬]:
1. A y B son ambos verdaderos [conjunción ∧]
En todos los demás casos, correct es falso.
Notación formal: ¬(A ∧ B)

Diagrama lógico

The De Morgan slip: NOT (A AND B) vs NOT A AND NOT B The De Morgan slip: NOT (A AND B) vs NOT A AND NOT B A B correctPRIMARY slip NOT AND AND NOT NOT
The De Morgan slip: NOT (A AND B) vs NOT A AND NOT B The De Morgan slip: NOT (A AND B) vs NOT A AND NOT B A B correctPRIMARY slip NOT AND AND NOT NOT

Simplificación paso a paso

El motor no encontró ninguna ley que acorte esta expresión; ya es tan corta como sus leyes de reescritura permiten.

NOT (A AND B)

Mapa de Karnaugh

A \ B
0
1
0
1m0
1m1
1
1m2
0m3
  1. celdas m0, m1NOT A
  2. celdas m0, m2NOT B
NOT A OR NOT B · Derived NOT A OR NOT B. Exactly equivalent on every assignment.

Mintérminos y maxtérminos

correct(A, B) = Σm(0, 1, 2)correct(A, B) = ΠM(3)

Orden de variables: A, B · 4 filas

Formas normales

Forma normal conjuntiva (FNC)

NOT A OR NOT B

1 cláusulas, 2 literales · complete · Ley de De Morgan ×1

Forma normal disyuntiva (FND)

NOT A OR NOT B

2 términos, 2 literales · complete · Ley de De Morgan ×1

Solo NAND, solo NOR

Forma solo con NAND

NAND(A, B)

1 compuertas · equivalencia verificada en todas las filas

Forma solo con NOR

NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B)))

7 compuertas · equivalencia verificada en todas las filas

La misma regla como código

Python
# -*- coding: utf-8 -*-
# Generated by Tangibool (tangibool.python/1). Do not edit by hand; regenerate from the source revision.
# Model: not stated
# Source revision: reference
# Interpretation status: not stated
"""Tangibool evaluator (decision model).

Generated deterministically from the validated Boolean model; it evaluates exactly that
model. It does not establish that the model is a complete, legal, or safe statement of a
real-world rule, and evaluating examples does not verify the rule.

Source revision: reference
Interpretation status: not stated
Exporter: 1.0.0 (format tangibool.python/1; engine 1.0.0; semantics tangibool-semantics/1)
Logic digest: 6b30e99f39396c495748d5bc38ba743c392c1a2683248c279a6c5f55fa9ddeb9
Assumptions digest: d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78

Inputs (dict keys, declared order) and generated parameter names:
    'A' -> input_A
    'B' -> input_B

Outputs (declared order) and their functions:
    'correct' -> output_correct(inputs)
    'slip' -> output_slip(inputs)

Assumptions (the declared scope, checked by in_scope(inputs)):
    none; every complete assignment is in scope.

Input contract:
    Every required input must be exactly True or False (type(value) is bool). Missing
    inputs, None, strings, integers (including 0 and 1), and keys that are not declared
    inputs raise InputError before anything is evaluated, including inputs that a
    short-circuiting operator would never read. Results are always bool.

Scope:
    Decision functions raise OutOfScopeError when the inputs violate an assumption; an
    out-of-scope assignment is never turned into a False result. Pass check_scope=False
    to evaluate without the scope check, and use in_scope(inputs) to test it separately.

Usage:

    import tangibool_model as model

    model.evaluate({'A': False, 'B': False})
    # -> {'correct': True, 'slip': True}
    model.output_correct({'A': False, 'B': False})
    # -> True
    model.evaluate({'A': 1, 'B': False})
    # raises InputError: 1 is an int, not a bool
"""

import collections.abc as _abc
from typing import Dict, Mapping, Tuple

__all__ = [
    "MODEL_INFO",
    "IDENTIFIER_MAP",
    "INPUT_NAMES",
    "OUTPUT_NAMES",
    "ASSUMPTIONS",
    "InputError",
    "OutOfScopeError",
    "minterm_index",
    "in_scope",
    "evaluate",
    "output_correct",
    "output_slip",
]

MODEL_INFO = {
    "format": "tangibool.python/1",
    "mode": "decision",
    "model": None,
    "revision": "reference",
    "interpretation": None,
    "exporter": "1.0.0",
    "engine_version": "1.0.0",
    "semantics_version": "tangibool-semantics/1",
    "logic_digest": "6b30e99f39396c495748d5bc38ba743c392c1a2683248c279a6c5f55fa9ddeb9",
    "assumptions_digest": "d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78",
    "primary_output": "correct",
    "unused_inputs": (),
    "subcircuits": (),
}

# Stable ID -> generated identifier (reversible mapping; names are exact, escaped strings).
IDENTIFIER_MAP = {
    "v_ea094d81f4a2": {"kind": "input", "name": "A", "identifier": "input_A"},
    "v_6b31c4bcd7c7": {"kind": "input", "name": "B", "identifier": "input_B"},
    "f_8d810c837ef1": {"kind": "output", "name": "correct", "identifier": "output_correct"},
    "f_cd56f351b70d": {"kind": "output", "name": "slip", "identifier": "output_slip"},
}

INPUT_NAMES = ("A", "B")
OUTPUT_NAMES = ("correct", "slip")
ASSUMPTIONS = ()

_DECLARED_INPUTS = frozenset(INPUT_NAMES)
_SCOPE_INPUTS = ()
_ASSUMPTION_FORMULAS = {entry["name"]: entry["formula"] for entry in ASSUMPTIONS}


class InputError(ValueError):
    """Raised when inputs are missing, undeclared, or not exactly True/False.

    Every required input must satisfy type(value) is bool. Missing inputs, None, strings,
    integers (including 0 and 1), and keys that are not declared inputs are rejected before
    anything is evaluated. A missing input is never treated as False. The individual problems
    are listed in the problems attribute.
    """

    def __init__(self, problems):
        self.problems = tuple(problems)
        super().__init__("Invalid inputs: " + "; ".join(self.problems))


class OutOfScopeError(ValueError):
    """Raised when the inputs violate the model's assumptions (its declared scope).

    Outside its assumptions the rule has no decision: this error is never a False result.
    The names of the violated assumptions are in the violated attribute.
    """

    def __init__(self, violated):
        self.violated = tuple(violated)
        details = ", ".join(name + " (" + _ASSUMPTION_FORMULAS.get(name, "?") + ")" for name in self.violated)
        super().__init__(
            "Out of scope: the inputs violate "
            + ("assumption " if len(self.violated) == 1 else "assumptions ")
            + details
            + ". The rule has no decision outside its assumptions; this is not a False result."
        )


def _short_repr(value: object) -> str:
    text = repr(value)
    return text if len(text) <= 60 else text[:57] + "..."


def _checked_inputs(inputs: Mapping[str, bool], required: Tuple[str, ...], check_scope: bool) -> Dict[str, bool]:
    """Validate inputs strictly before anything is evaluated and return a plain copy."""
    if type(check_scope) is not bool:
        raise TypeError("check_scope must be True or False")
    if not isinstance(inputs, _abc.Mapping):
        raise InputError(["inputs must be a mapping from input names to True/False, got " + type(inputs).__name__])
    problems = []
    for key in inputs:
        if type(key) is not str or key not in _DECLARED_INPUTS:
            declared = ", ".join(repr(name) for name in INPUT_NAMES) or "none"
            problems.append("undeclared input " + _short_repr(key) + " (declared inputs: " + declared + ")")
    needed = tuple(required) + (_SCOPE_INPUTS if check_scope else ())
    for name in needed:
        if name not in inputs:
            problems.append("missing required input " + repr(name))
    for key, value in inputs.items():
        if type(key) is str and key in _DECLARED_INPUTS and type(value) is not bool:
            problems.append(
                "input " + repr(key) + " must be True or False (type bool), got "
                + type(value).__name__ + " " + _short_repr(value)
            )
    if problems:
        raise InputError(list(dict.fromkeys(problems)))
    return dict(inputs.items())


def _require_bool_args(function: str, pairs: Tuple[Tuple[str, object], ...]) -> None:
    problems = [
        "argument " + repr(name) + " of " + function + " must be True or False (type bool), got "
        + type(value).__name__ + " " + _short_repr(value)
        for name, value in pairs
        if type(value) is not bool
    ]
    if problems:
        raise InputError(problems)


def minterm_index(*values: bool) -> int:
    """Row index of an assignment over a declared variable order.

    The first value is the most significant bit, so all-False is row 0. Used for indexed
    minterm (sum) and maxterm (product) forms.
    """
    index = 0
    for value in values:
        if type(value) is not bool:
            raise InputError(["minterm_index() takes True/False values, got " + type(value).__name__ + " " + _short_repr(value)])
        index = index * 2 + (1 if value else 0)
    return index


def _scope_values(values: Dict[str, bool]) -> Tuple[Tuple[str, bool], ...]:
    """Value of every enabled, confirmed assumption for validated inputs, in declared order."""
    return ()


def _require_in_scope(values: Dict[str, bool]) -> None:
    violated = tuple(name for name, holds in _scope_values(values) if not holds)
    if violated:
        raise OutOfScopeError(violated)


def in_scope(inputs: Mapping[str, bool]) -> bool:
    """True when the inputs satisfy every assumption (the model's declared scope).

    Requires the inputs the assumptions read; raises InputError for invalid inputs.
    """
    values = _checked_inputs(inputs, (), True)
    return all(holds for _, holds in _scope_values(values))


# ---- Formula bodies (inputs are validated by the public functions below) ----


def _compute_output_correct(input_A: bool, input_B: bool) -> bool:
    """Decision output 'correct': NOT (A AND B)"""
    return not (input_A and input_B)


def _compute_output_slip(input_A: bool, input_B: bool) -> bool:
    """Decision output 'slip': NOT A AND NOT B"""
    return (not input_A) and (not input_B)


# ---- Public API ----


def output_correct(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
    """Decision output 'correct' (stable ID f_8d810c837ef1).

    'correct' := NOT (A AND B)

    Required inputs: 'A', 'B'.
    Raises InputError for missing, undeclared, or non-bool inputs, and OutOfScopeError
    when check_scope is True and the inputs violate an assumption.
    """
    values = _checked_inputs(inputs, ("A", "B"), check_scope)
    if check_scope:
        _require_in_scope(values)
    output_correct_value = _compute_output_correct(values["A"], values["B"])
    return output_correct_value


def output_slip(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
    """Decision output 'slip' (stable ID f_cd56f351b70d).

    'slip' := NOT A AND NOT B

    Required inputs: 'A', 'B'.
    Raises InputError for missing, undeclared, or non-bool inputs, and OutOfScopeError
    when check_scope is True and the inputs violate an assumption.
    """
    values = _checked_inputs(inputs, ("A", "B"), check_scope)
    if check_scope:
        _require_in_scope(values)
    output_slip_value = _compute_output_slip(values["A"], values["B"])
    return output_slip_value


def evaluate(inputs: Mapping[str, bool], *, check_scope: bool = True) -> Dict[str, bool]:
    """Evaluate every output (declared order); each output is computed once.

    Required inputs: 'A', 'B'.
    Raises InputError for missing, undeclared, or non-bool inputs, and OutOfScopeError
    when check_scope is True and the inputs violate an assumption.
    """
    values = _checked_inputs(inputs, ("A", "B"), check_scope)
    if check_scope:
        _require_in_scope(values)
    output_correct_value = _compute_output_correct(values["A"], values["B"])
    output_slip_value = _compute_output_slip(values["A"], values["B"])
    return {
        "correct": output_correct_value,
        "slip": output_slip_value,
    }
PostgreSQL
-- Tangibool PostgreSQL export (tangibool.postgresql/1)
-- Target: PostgreSQL 16 or later with typed boolean inputs; tested with PostgreSQL 18.3 (PGlite 0.5.8).
-- Not a claim of compatibility with other SQL dialects.
-- Model: not stated
-- Source revision: reference
-- Interpretation status: not stated
-- Exporter: 1.0.0 (engine 1.0.0; semantics tangibool-semantics/1)
-- Logic digest: 6b30e99f39396c495748d5bc38ba743c392c1a2683248c279a6c5f55fa9ddeb9
-- Assumptions digest: d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78
-- Mode: decision
--
-- Read-only: this file contains only WITH / VALUES / SELECT statements. No DDL, DML,
-- procedures, credentials, network access, or database changes. The expressions are pure
-- Boolean expressions, so their result does not depend on SQL evaluation order.
--
-- NON-NULL INPUT PRECONDITION: NULL is not a truth value of this rule. Every fragment below
-- is defined only when every input column it reads is a non-NULL boolean. The guard template
-- (section 2) marks any NULL input as 'invalid_input' and any row that violates the
-- assumptions as 'out_of_scope', and fills output columns only for 'ok' rows; a NULL in an
-- output column of another row is an envelope marker, not a third truth value. Never wrap
-- the fragments in COALESCE(..., FALSE) or otherwise choose a meaning for unknown inputs.
-- This evaluates the supplied model; it does not show that the model is a complete, legal,
-- or safe statement of a real-world rule.
--
-- Input columns (stable ID: name -> column):
--   v_ea094d81f4a2: A -> "in_A"
--   v_6b31c4bcd7c7: B -> "in_B"
-- Output columns:
--   f_8d810c837ef1: correct -> "out_correct"
--   f_cd56f351b70d: slip -> "out_slip"
-- Assumptions (scope K; exported separately and never folded into an output):
--   none; every complete input row is in scope.

-- ----------------------------------------------------------------------------------------------
-- 1. Expression fragments (parenthesised; non-NULL boolean inputs required)
-- ----------------------------------------------------------------------------------------------
--
-- [out_correct] output correct (stable ID f_8d810c837ef1)
--   correct := NOT (A AND B)
--   PRECONDITION: "in_A", "in_B" are non-NULL booleans.
--   (NOT ("in_A" AND "in_B"))
--
-- [out_slip] output slip (stable ID f_cd56f351b70d)
--   slip := NOT A AND NOT B
--   PRECONDITION: "in_A", "in_B" are non-NULL booleans.
--   ((NOT "in_A") AND (NOT "in_B"))
--

-- ----------------------------------------------------------------------------------------------
-- 2. Guard template (read-only SELECT over an inputs list)
-- ----------------------------------------------------------------------------------------------
-- Replace the example rows between the markers with your own rows, or replace the inputs
-- CTE with a SELECT that provides the boolean columns listed in the header. status is
-- 'invalid_input' when any input is NULL, 'out_of_scope' when the assumptions are false, and
-- 'ok' otherwise; output columns are filled only for 'ok' rows (NULL elsewhere is an
-- envelope marker). Assumption columns are shown for rows with complete inputs.
WITH inputs ("row_id", "in_A", "in_B") AS (
  -- tangibool:example-rows:begin
  VALUES
    (1, FALSE, FALSE),
    (2, FALSE, TRUE),
    (3, TRUE, FALSE),
    (4, TRUE, TRUE),
    (5, NULL::boolean, FALSE)
  -- tangibool:example-rows:end
),
checked AS (
  SELECT
    inputs.*,
    CASE
      WHEN "in_A" IS NULL OR "in_B" IS NULL THEN 'invalid_input'
      ELSE 'ok'
    END AS "status"
  FROM inputs
)
SELECT
  "row_id",
  "in_A",
  "in_B",
  "status",
  CASE WHEN "status" = 'ok' THEN (NOT ("in_A" AND "in_B")) END AS "out_correct",
  CASE WHEN "status" = 'ok' THEN ((NOT "in_A") AND (NOT "in_B")) END AS "out_slip"
FROM checked
ORDER BY "row_id";
SMT-LIB
; Tangibool SMT-LIB export (tangibool.smtlib/1)
; Profile: SMT-LIB 2.6 Boolean subset (QF_UF): Bool constants, define-fun, let, push/pop, assert, check-sat, echo.
; Tested with Z3 5.1.0 (z3-solver 5.2.0, WebAssembly build).
; Model: not stated
; Source revision: reference
; Interpretation status: not stated
; Exporter: 1.0.0 (engine 1.0.0; semantics tangibool-semantics/1)
; Logic digest: 6b30e99f39396c495748d5bc38ba743c392c1a2683248c279a6c5f55fa9ddeb9
; Assumptions digest: d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78
; Mode: decision
;
; Reading results: each query block states what sat and unsat mean for its question. A sat
; answer comes with a witness or counterexample (ask for it with (get-model) after sat only);
; unsat settles that scoped query and is solver-checked, not an independently checked proof
; certificate; unknown settles nothing. Blocks are scoped with push/pop, so assertions never
; accumulate across questions. This checks the supplied model, not whether it is a complete,
; legal, or safe statement of a real-world rule.
;
; Symbols (stable ID: name -> symbol):
;   v_ea094d81f4a2: A -> in_A
;   v_6b31c4bcd7c7: B -> in_B
;   f_8d810c837ef1: correct -> out_correct
;   f_cd56f351b70d: slip -> out_slip

(set-option :produce-models true)
(set-info :smt-lib-version 2.6)
(set-logic QF_UF)

; ---- Inputs (declared order)
(declare-const in_A Bool) ; A
(declare-const in_B Bool) ; B

; ---- Outputs (dependencies first)
; output correct (stable ID f_8d810c837ef1): NOT (A AND B)
(define-fun out_correct () Bool (not (and in_A in_B)))
; output slip (stable ID f_cd56f351b70d): NOT A AND NOT B
(define-fun out_slip () Bool (and (not in_A) (not in_B)))

; ---- Assumptions (the scope K; never folded into an output)
; K: conjunction of the enabled, confirmed assumptions (true when there are none)
(define-fun K () Bool true)

; ---- Definitions only: nothing is asserted and no check is run.
; Add (assert ...) and (check-sat) inside (push 1) ... (pop 1) to ask a question.
LaTeX
correct = \overline{A \cdot B}
slip = \overline{A} \cdot \overline{B}

El error habitual

Probar solo los extremos. Con A = FALSO, B = FALSO las dos fórmulas son verdaderas y con A = VERDADERO, B = VERDADERO las dos son falsas, y una prueba de dos casos aprueba el error. Las filas mixtas, A = FALSO, B = VERDADERO y A = VERDADERO, B = FALSO, muestran la diferencia.

Preguntas

¿Cuál es la negación correcta de A AND B?

NOT A OR NOT B, con el operador invertido. La página del ejemplo de De Morgan comprueba esa reescritura y la encuentra equivalente en las cuatro filas. NOT A AND NOT B es en cambio la negación de A OR B, que es la otra mitad de la ley de De Morgan.

Relacionado

Operadores y compuertas

Herramientas

Ejercicios

Véase también

Ejemplos resueltos

Generado a partir del motor de Tangibool, semántica tangibool-semantics/1, motor 1.0.0, compilación . Cada tabla, mapa, simplificación y veredicto de estas páginas lo calculó el motor de Tangibool al compilar el sitio, y cada afirmación la volvió a comprobar el mismo verificador exacto que usa la app. Los límites se indican donde aplican. © 2026 Foreranger LTD.