Quórum: al menos tres de cuatro, tabla de verdad y mapa de Karnaugh
Un quórum de al menos tres de cuatro, escrito como el OR de las cuatro ternas. Dieciséis filas con cinco que aprueban, una FNC de seis cláusulas, un mapa con cuatro grupos unidos en la celda 15, y 39 NAND frente a 159 NOR.
Cuatro miembros votan y la moción se aprueba cuando al menos tres están de acuerdo. La fórmula enumera las cuatro ternas, (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D), y la lectura del motor dice que quorum se cumple cuando al menos una de esas cuatro conjunciones es verdadera por completo. En la tabla de dieciséis filas la salida es verdadera en cinco, Σm(7, 11, 13, 14, 15): las cuatro filas con exactamente tres síes y la fila con cuatro.
No es tautología, contraejemplo las cuatro entradas en FALSO; satisfacible, testigo A = FALSO, B = VERDADERO, C = VERDADERO, D = VERDADERO. El simplificador no encontró ninguna ley que acorte la expresión de once operadores; la FND es la original. El conversor a FNC, con distributividad, idempotencia y absorción, produce (A OR B) AND (A OR C) AND (A OR D) AND (B OR C) AND (B OR D) AND (C OR D), seis cláusulas de dos literales: ningún par puede votar no a la vez. El mapa dibuja cuatro grupos de dos celdas, uno por terna, todos unidos en la celda 15, cuatro implicantes primos, y deriva la original. Compuertas: 39 NAND, 159 NOR.
Las reglas de umbral de este tipo aparecen en el consenso distribuido, en las aprobaciones con varias firmas y en la votación de sensores redundantes, y las dos formas normales son las dos maneras de auditarlas: la FND enumera las coaliciones ganadoras, la FNC los pares bloqueantes. Lo que hay que vigilar cuando el comité crece es el tamaño. Cuatro miembros dan cuatro ternas y seis pares; el número de términos crece deprisa con más miembros, así que para umbrales mayores un recuento es la forma práctica: votes >= 3 en código, y en el motor la compuerta única AT_LEAST(3; A, B, C, D), que la ley de desarrollo de una restricción de recuento reescribe como las cuatro ternas, con la tabla como oráculo de que el recuento y la fórmula coinciden.
quorum := (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D) · salida
Comprobaciones exactas
Tabla de verdad (16 filas)
| # | A | B | C | D | quorum |
|---|---|---|---|---|---|
| 0 | FALSO | FALSO | FALSO | FALSO | FALSO |
| 1 | FALSO | FALSO | FALSO | VERDADERO | FALSO |
| 2 | FALSO | FALSO | VERDADERO | FALSO | FALSO |
| 3 | FALSO | FALSO | VERDADERO | VERDADERO | FALSO |
| 4 | FALSO | VERDADERO | FALSO | FALSO | FALSO |
| 5 | FALSO | VERDADERO | FALSO | VERDADERO | FALSO |
| 6 | FALSO | VERDADERO | VERDADERO | FALSO | FALSO |
| 7 | FALSO | VERDADERO | VERDADERO | VERDADERO | VERDADERO |
| 8 | VERDADERO | FALSO | FALSO | FALSO | FALSO |
| 9 | VERDADERO | FALSO | FALSO | VERDADERO | FALSO |
| 10 | VERDADERO | FALSO | VERDADERO | FALSO | FALSO |
| 11 | VERDADERO | FALSO | VERDADERO | VERDADERO | VERDADERO |
| 12 | VERDADERO | VERDADERO | FALSO | FALSO | FALSO |
| 13 | VERDADERO | VERDADERO | FALSO | VERDADERO | VERDADERO |
| 14 | VERDADERO | VERDADERO | VERDADERO | FALSO | VERDADERO |
| 15 | VERDADERO | VERDADERO | VERDADERO | VERDADERO | VERDADERO |
Lectura en lenguaje claro
Principiantequorum es verdadero exactamente cuando se cumple al menos una de las condiciones siguientes (pueden cumplirse varias):
1. A, B y C son todos verdaderos
2. A, B y D son todos verdaderos
3. A, C y D son todos verdaderos
4. B, C y D son todos verdaderos
En todos los demás casos, quorum es falso.
Sobre los operadores:
- OR (O) es inclusivo: es verdadero en cuanto al menos una parte es verdadera, también cuando lo son varias.
- AND (Y) solo es verdadero cuando todas sus partes son verdaderas.
Intermedioquorum es verdadero exactamente cuando se cumple al menos una de las condiciones siguientes (pueden cumplirse varias):
1. A, B y C son todos verdaderos
2. A, B y D son todos verdaderos
3. A, C y D son todos verdaderos
4. B, C y D son todos verdaderos
En todos los demás casos, quorum es falso.
Avanzadoquorum es verdadero exactamente cuando se cumple al menos una de las condiciones siguientes (pueden cumplirse varias) [disyunción inclusiva ∨]:
1. A, B y C son todos verdaderos [conjunción ∧]
2. A, B y D son todos verdaderos [conjunción ∧]
3. A, C y D son todos verdaderos [conjunción ∧]
4. B, C y D son todos verdaderos [conjunción ∧]
En todos los demás casos, quorum es falso.
Notación formal: (A ∧ B ∧ C) ∨ (A ∧ B ∧ D) ∨ (A ∧ C ∧ D) ∨ (B ∧ C ∧ D)
Diagrama lógico
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.
(A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D)
Mapa de Karnaugh
- celdas m14, m15
A AND B AND C - celdas m13, m15
A AND B AND D - celdas m11, m15
A AND C AND D - celdas m7, m15
B AND C AND D
Mintérminos y maxtérminos
quorum(A, B, C, D) = Σm(7, 11, 13, 14, 15)quorum(A, B, C, D) = ΠM(0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12)Orden de variables: A, B, C, D · 16 filas
Formas normales
Forma normal conjuntiva (FNC)
(A OR B) AND (A OR C) AND (A OR D) AND (B OR C) AND (B OR D) AND (C OR D)6 cláusulas, 12 literales · complete · Distributividad ×3, Idempotencia ×7, Absorción ×10
Forma normal disyuntiva (FND)
(A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D)4 términos, 12 literales · complete
Solo NAND, solo NOR
Forma solo con NAND
NAND(NAND(NAND(NAND(NAND(NAND(A, B), NAND(A, B)), C), NAND(NAND(NAND(A, B), NAND(A, B)), D)), NAND(NAND(NAND(NAND(A, B), NAND(A, B)), C), NAND(NAND(NAND(A, B), NAND(A, B)), D))), NAND(NAND(NAND(NAND(NAND(A, C), NAND(A, C)), D), NAND(NAND(NAND(B, C), NAND(B, C)), D)), NAND(NAND(NAND(NAND(A, C), NAND(A, C)), D), NAND(NAND(NAND(B, C), NAND(B, C)), D))))39 compuertas · equivalencia verificada en todas las filas
Forma solo con NOR
NOR(NOR(NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(C, C)), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(D, D))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(C, C)), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(D, D)))), NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(C, C)), NOR(NOR(A, A), NOR(C, C))), NOR(D, D)), NOR(NOR(NOR(NOR(B, B), NOR(C, C)), NOR(NOR(B, B), NOR(C, C))), NOR(D, D))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(C, C)), NOR(NOR(A, A), NOR(C, C))), NOR(D, D)), NOR(NOR(NOR(NOR(B, B), NOR(C, C)), NOR(NOR(B, B), NOR(C, C))), NOR(D, D))))), NOR(NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(C, C)), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(D, D))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(C, C)), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(D, D)))), NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(C, C)), NOR(NOR(A, A), NOR(C, C))), NOR(D, D)), NOR(NOR(NOR(NOR(B, B), NOR(C, C)), NOR(NOR(B, B), NOR(C, C))), NOR(D, D))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(C, C)), NOR(NOR(A, A), NOR(C, C))), NOR(D, D)), NOR(NOR(NOR(NOR(B, B), NOR(C, C)), NOR(NOR(B, B), NOR(C, C))), NOR(D, D))))))159 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: edb9bad2ae5b878e3c832dd93b01998703f9932f2fb92ba5ff27ab209e5f55d1
Assumptions digest: d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78
Inputs (dict keys, declared order) and generated parameter names:
'A' -> input_A
'B' -> input_B
'C' -> input_C
'D' -> input_D
Outputs (declared order) and their functions:
'quorum' -> output_quorum(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, 'C': False, 'D': False})
# -> {'quorum': False}
model.output_quorum({'A': False, 'B': False, 'C': False, 'D': False})
# -> False
model.evaluate({'A': 1, 'B': False, 'C': False, 'D': 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_quorum",
]
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": "edb9bad2ae5b878e3c832dd93b01998703f9932f2fb92ba5ff27ab209e5f55d1",
"assumptions_digest": "d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78",
"primary_output": "quorum",
"unused_inputs": (),
"subcircuits": (),
}
# Stable ID -> generated identifier (reversible mapping; names are exact, escaped strings).
IDENTIFIER_MAP = {
"v_4353cef384a1": {"kind": "input", "name": "A", "identifier": "input_A"},
"v_bab49c4451fc": {"kind": "input", "name": "B", "identifier": "input_B"},
"v_49b26e770fc0": {"kind": "input", "name": "C", "identifier": "input_C"},
"v_dc5ebb6462f9": {"kind": "input", "name": "D", "identifier": "input_D"},
"f_324d85155616": {"kind": "output", "name": "quorum", "identifier": "output_quorum"},
}
INPUT_NAMES = ("A", "B", "C", "D")
OUTPUT_NAMES = ("quorum",)
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_quorum(input_A: bool, input_B: bool, input_C: bool, input_D: bool) -> bool:
"""Decision output 'quorum': (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D)"""
return (input_A and input_B and input_C) or (input_A and input_B and input_D) or (input_A and input_C and input_D) or (input_B and input_C and input_D)
# ---- Public API ----
def output_quorum(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
"""Decision output 'quorum' (stable ID f_324d85155616).
'quorum' := (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D)
Required inputs: 'A', 'B', 'C', 'D'.
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", "C", "D"), check_scope)
if check_scope:
_require_in_scope(values)
output_quorum_value = _compute_output_quorum(values["A"], values["B"], values["C"], values["D"])
return output_quorum_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', 'C', 'D'.
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", "C", "D"), check_scope)
if check_scope:
_require_in_scope(values)
output_quorum_value = _compute_output_quorum(values["A"], values["B"], values["C"], values["D"])
return {
"quorum": output_quorum_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: edb9bad2ae5b878e3c832dd93b01998703f9932f2fb92ba5ff27ab209e5f55d1
-- 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_4353cef384a1: A -> "in_A"
-- v_bab49c4451fc: B -> "in_B"
-- v_49b26e770fc0: C -> "in_C"
-- v_dc5ebb6462f9: D -> "in_D"
-- Output columns:
-- f_324d85155616: quorum -> "out_quorum"
-- 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_quorum] output quorum (stable ID f_324d85155616)
-- quorum := (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D)
-- PRECONDITION: "in_A", "in_B", "in_C", "in_D" are non-NULL booleans.
-- (("in_A" AND "in_B" AND "in_C") OR ("in_A" AND "in_B" AND "in_D") OR ("in_A" AND "in_C" AND "in_D") OR ("in_B" AND "in_C" AND "in_D"))
--
-- ----------------------------------------------------------------------------------------------
-- 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", "in_C", "in_D") AS (
-- tangibool:example-rows:begin
VALUES
(1, FALSE, FALSE, FALSE, FALSE),
(2, FALSE, FALSE, FALSE, TRUE),
(3, FALSE, FALSE, TRUE, FALSE),
(4, FALSE, FALSE, TRUE, TRUE),
(5, FALSE, TRUE, FALSE, FALSE),
(6, FALSE, TRUE, FALSE, TRUE),
(7, FALSE, TRUE, TRUE, FALSE),
(8, FALSE, TRUE, TRUE, TRUE),
(9, TRUE, FALSE, FALSE, FALSE),
(10, TRUE, FALSE, FALSE, TRUE),
(11, TRUE, FALSE, TRUE, FALSE),
(12, TRUE, FALSE, TRUE, TRUE),
(13, TRUE, TRUE, FALSE, FALSE),
(14, TRUE, TRUE, FALSE, TRUE),
(15, TRUE, TRUE, TRUE, FALSE),
(16, TRUE, TRUE, TRUE, TRUE),
(17, NULL::boolean, FALSE, FALSE, FALSE)
-- tangibool:example-rows:end
),
checked AS (
SELECT
inputs.*,
CASE
WHEN "in_A" IS NULL OR "in_B" IS NULL OR "in_C" IS NULL OR "in_D" IS NULL THEN 'invalid_input'
ELSE 'ok'
END AS "status"
FROM inputs
)
SELECT
"row_id",
"in_A",
"in_B",
"in_C",
"in_D",
"status",
CASE WHEN "status" = 'ok' THEN (("in_A" AND "in_B" AND "in_C") OR ("in_A" AND "in_B" AND "in_D") OR ("in_A" AND "in_C" AND "in_D") OR ("in_B" AND "in_C" AND "in_D")) END AS "out_quorum"
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: edb9bad2ae5b878e3c832dd93b01998703f9932f2fb92ba5ff27ab209e5f55d1 ; 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_4353cef384a1: A -> in_A ; v_bab49c4451fc: B -> in_B ; v_49b26e770fc0: C -> in_C ; v_dc5ebb6462f9: D -> in_D ; f_324d85155616: quorum -> out_quorum (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 (declare-const in_C Bool) ; C (declare-const in_D Bool) ; D ; ---- Outputs (dependencies first) ; output quorum (stable ID f_324d85155616): (A AND B AND C) OR (A AND B AND D) OR (A AND C AND D) OR (B AND C AND D) (define-fun out_quorum () Bool (or (and in_A in_B in_C) (and in_A in_B in_D) (and in_A in_C in_D) (and in_B in_C in_D))) ; ---- 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
quorum = \left(A \cdot B \cdot C\right) + \left(A \cdot B \cdot D\right) + \left(A \cdot C \cdot D\right) + \left(B \cdot C \cdot D\right)
El error habitual
Esperar que la regla se acorte. El mapa muestra cuatro implicantes primos que solo se solapan en la celda 15, así que ninguna terna es redundante, y el simplificador no encuentra ley aplicable. La FNC de seis cláusulas es la única descripción más corta, y lo es en literales por cláusula, no en número de cláusulas.
Preguntas
¿Por qué la FNC tiene exactamente seis cláusulas?
Cada cláusula prohíbe que un par de miembros vote no a la vez, y hay seis pares entre cuatro miembros. Dos noes cualesquiera dejan como mucho dos síes, que no alcanzan el umbral; un solo no sigue dejando tres. La equivalencia de este producto con las cuatro ternas se comprueba en las dieciséis filas.
Relacionado
Operadores y compuertas
- Compuerta AND (puerta Y): tabla de verdad de 2, 3 y 4 entradas, símbolo y expresión
- Compuerta OR (puerta O): tabla de verdad de 2, 3 y 4 entradas
Herramientas
- Generador de tablas de verdad: cualquier expresión booleana, hasta 12 variables, con columnas intermedias
- Calculadora y simplificador de álgebra de Boole paso a paso (cada ley nombrada y verificada)
- Solucionador de mapas de Karnaugh: de 2 a 4 variables, agrupaciones, SOP y POS
Véase también
- Mayoría de tres (votación 2 de 3): tabla de verdad, mapa de Karnaugh y forma NAND
- Solucionador de mapas de Karnaugh: de 2 a 4 variables, agrupaciones, SOP y POS
- Conversor a FNC y FND: formas normales conjuntiva y disyuntiva, mintérminos y maxtérminos
- Suma de productos frente a producto de sumas
- Exactamente uno de tres: por qué XOR no sirve
- Implicante primo: definición, ejemplo y equivalente en inglés
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.