De Morgan in code: !(a && b) refactored to !a || !b, verified
The refactor !(a && b) to !a || !b, modelled as NOT (a AND b) against NOT a OR NOT b. The equivalence check holds on all four rows, so the rewrite is safe to commit; the NAND-only form is a single gate.
A reviewer asks for the negated compound condition to be rewritten with the negations on the operands, which is De Morgan's law applied to code. The model names the two versions before and after, using the lowercase identifiers from the source. The engine's reading of before says it is true exactly when the condition “both a and b are true” does not hold. On the four-row table both columns are true on rows 0, 1 and 2, Σm(0, 1, 2), and false only when both variables are true.
The equivalence check holds: before and after agree on every assignment, which is the fact the pull request needs. Not a tautology, counterexample a = TRUE, b = TRUE; satisfiable, witness a = FALSE, b = FALSE. The simplifier found no law that shortens the two-operator original, since De Morgan keeps the operator count. The normal-form converter applies De Morgan once, and both the CNF and the DNF are NOT a OR NOT b. The Karnaugh map draws NOT a and NOT b, two prime implicants, deriving the same expression. The NAND-only form is 1 gate, NAND(a, b); the NOR-only form needs 7.
In a language with short-circuit evaluation the two spellings are equivalent as Boolean functions but may differ in what they evaluate: !a || !b stops after !a when a is false, exactly as !(a && b) stops after a. The model sees only the values, not the side effects. The thing to watch is therefore not the logic, which the table settles, but whether a and b are pure expressions; when they are, the refactor is a free choice of readability, and the exported Python on the page is one place to see the two spellings side by side.
before := NOT (a AND b) · outputafter := NOT a OR NOT b · output
Exact checks
Truth table (4 rows)
| # | a | b | before | after |
|---|---|---|---|---|
| 0 | FALSE | FALSE | TRUE | TRUE |
| 1 | FALSE | TRUE | TRUE | TRUE |
| 2 | TRUE | FALSE | TRUE | TRUE |
| 3 | TRUE | TRUE | FALSE | FALSE |
Plain-language reading
Beginnerbefore is true exactly when the following condition does not hold:
1. both a and b are true
In every other case, before is false.
About the operators:
- NOT reverses a value: true becomes false and false becomes true.
- AND is true only when all of its parts are true.
Intermediatebefore is true exactly when the following condition does not hold:
1. both a and b are true
In every other case, before is false.
Advancedbefore is true exactly when the following condition does not hold [negation ¬]:
1. both a and b are true [conjunction ∧]
In every other case, before is false.
Formal notation: ¬(a ∧ b)
Logic diagram
Simplification, step by step
The engine found no law that shortens this expression; it is already as short as its rewriting laws can make it.
NOT (a AND b)
Karnaugh map
- cells m0, m1
NOT a - cells m0, m2
NOT b
Minterms and maxterms
before(a, b) = Σm(0, 1, 2)before(a, b) = ΠM(3)Variable order: a, b · 4 rows
Normal forms
Conjunctive normal form (CNF)
NOT a OR NOT b1 clauses, 2 literals · complete · De Morgan's law ×1
Disjunctive normal form (DNF)
NOT a OR NOT b2 terms, 2 literals · complete · De Morgan's law ×1
NAND-only and NOR-only
NAND-only form
NAND(a, b)1 gates · verified equivalent on every row
NOR-only form
NOR(NOR(NOR(a, a), NOR(b, b)), NOR(NOR(a, a), NOR(b, b)))7 gates · verified equivalent on every row
The same rule as code
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: 3b8103d4010f68d18f274b61ce5ae64ff6142ca8bbb7a865f04398e0de68aa78
Assumptions digest: d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78
Inputs (dict keys, declared order) and generated parameter names:
'a' -> input_a
'b' -> input_b
Outputs (declared order) and their functions:
'before' -> output_before(inputs)
'after' -> output_after(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})
# -> {'before': True, 'after': True}
model.output_before({'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_before",
"output_after",
]
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": "3b8103d4010f68d18f274b61ce5ae64ff6142ca8bbb7a865f04398e0de68aa78",
"assumptions_digest": "d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78",
"primary_output": "before",
"unused_inputs": (),
"subcircuits": (),
}
# Stable ID -> generated identifier (reversible mapping; names are exact, escaped strings).
IDENTIFIER_MAP = {
"v_2a67295e86b5": {"kind": "input", "name": "a", "identifier": "input_a"},
"v_2fccf6970f7e": {"kind": "input", "name": "b", "identifier": "input_b"},
"f_cb915e33b6ef": {"kind": "output", "name": "before", "identifier": "output_before"},
"f_291eddc26c70": {"kind": "output", "name": "after", "identifier": "output_after"},
}
INPUT_NAMES = ("a", "b")
OUTPUT_NAMES = ("before", "after")
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_before(input_a: bool, input_b: bool) -> bool:
"""Decision output 'before': NOT (a AND b)"""
return not (input_a and input_b)
def _compute_output_after(input_a: bool, input_b: bool) -> bool:
"""Decision output 'after': NOT a OR NOT b"""
return (not input_a) or (not input_b)
# ---- Public API ----
def output_before(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
"""Decision output 'before' (stable ID f_cb915e33b6ef).
'before' := 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_before_value = _compute_output_before(values["a"], values["b"])
return output_before_value
def output_after(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
"""Decision output 'after' (stable ID f_291eddc26c70).
'after' := NOT a OR 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_after_value = _compute_output_after(values["a"], values["b"])
return output_after_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_before_value = _compute_output_before(values["a"], values["b"])
output_after_value = _compute_output_after(values["a"], values["b"])
return {
"before": output_before_value,
"after": output_after_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: 3b8103d4010f68d18f274b61ce5ae64ff6142ca8bbb7a865f04398e0de68aa78
-- 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_2a67295e86b5: a -> "in_a"
-- v_2fccf6970f7e: b -> "in_b"
-- Output columns:
-- f_cb915e33b6ef: before -> "out_before"
-- f_291eddc26c70: after -> "out_after"
-- 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_before] output before (stable ID f_cb915e33b6ef)
-- before := NOT (a AND b)
-- PRECONDITION: "in_a", "in_b" are non-NULL booleans.
-- (NOT ("in_a" AND "in_b"))
--
-- [out_after] output after (stable ID f_291eddc26c70)
-- after := NOT a OR NOT b
-- PRECONDITION: "in_a", "in_b" are non-NULL booleans.
-- ((NOT "in_a") OR (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_before",
CASE WHEN "status" = 'ok' THEN ((NOT "in_a") OR (NOT "in_b")) END AS "out_after"
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: 3b8103d4010f68d18f274b61ce5ae64ff6142ca8bbb7a865f04398e0de68aa78 ; 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_2a67295e86b5: a -> in_a ; v_2fccf6970f7e: b -> in_b ; f_cb915e33b6ef: before -> out_before ; f_291eddc26c70: after -> out_after (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 before (stable ID f_cb915e33b6ef): NOT (a AND b) (define-fun out_before () Bool (not (and in_a in_b))) ; output after (stable ID f_291eddc26c70): NOT a OR NOT b (define-fun out_after () Bool (or (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
before = \overline{a \cdot b}
after = \overline{a} + \overline{b}The common slip
Refactoring !(a && b) to !a && !b because the inner operator was copied with the operands. The slip page compares them: the two differ on a = TRUE, b = FALSE and a = FALSE, b = TRUE. A test with one flag set catches it; one with both set or both clear does not.
Questions
Which spelling should pass review?
Either, as far as the logic goes; the table proves them equal. Many style guides prefer !a || !b because each negation sits next to the thing it negates, while !(a && b) reads better when “both” is the business concept. What matters is that the equivalence was checked rather than assumed.
Related
Operators and gates
- NOT gate (inverter): truth table, symbol and the NOT operator
- AND gate: truth table for 2, 3 and 4 inputs, symbol and expression
- OR gate: truth table for 2, 3 and 4 inputs, inclusive or explained
Tools
- Truth table generator: any Boolean expression, up to 12 variables, with intermediate columns
- Boolean algebra calculator and simplifier with steps (every law named and verified)
- Karnaugh map solver: 2 to 4 variables, groups, SOP and POS, don’t-cares from assumptions
Practice
See also
- De Morgan in practice: NOT (A AND B) rewritten and verified
- The De Morgan slip: NOT (A AND B) vs NOT A AND NOT B
- De Morgan's laws: NOT (A AND B) = NOT A OR NOT B, with proof and examples
- Boolean logic in JavaScript: &&, ||, !, truthiness and precedence
- Boolean logic in Python: and, or, not, precedence and common mistakes
- Regression tests for decision rules that change
Worked examples
Generated from the Tangibool engine, semantics tangibool-semantics/1, engine 1.0.0, build . Every table, map, simplification and verdict on these pages was computed by the Tangibool engine when the site was built, and every claim was re-checked by the same exact checker the app uses. Limits are stated where they apply. © 2026 Foreranger LTD.