Four-variable product of sums: ΠM(…) simplified from the zeros
A four-variable function given by its zeros, ΠM(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14). The converter expands the maxterms into an eight-clause CNF, and the Karnaugh map reduces the ones to (NOT A AND NOT D) OR (A AND D).
Product-of-sums notation lists the rows where the function is false. Here the eight maxterms are rows 1, 3, 5, 7, 8, 10, 12 and 14, so the function is true on the other eight, Σm(0, 2, 4, 6, 9, 11, 13, 15). The engine's reading says f is true when the row of (A, B, C, D) is none of the listed ones. Looking at the true rows, they are the ones where A and D agree, both false in the first four and both true in the last four.
The checks: not a tautology, counterexample A = FALSE, B = FALSE, C = FALSE, D = TRUE; satisfiable, witness all four inputs FALSE. The simplifier found no law to apply to a maxterm list. The converter uses maxterm expansion once: the CNF is the eight-clause product, 32 literals, and the DNF is the matching eight-term sum, 32 literals. The gate converters report 767 NAND and 383 NOR for the expansion. The Karnaugh map draws two groups on the ones, NOT A AND NOT D and A AND D, two prime implicants, deriving (NOT A AND NOT D) OR (A AND D), exactly equivalent on every assignment.
Specifying by zeros is natural when the forbidden cases are the short list: error codes, disallowed state transitions, invalid combinations in a configuration matrix. The thing to watch is that the map on this page groups the ones and derives a sum of products, so the result is the complement of the forbidden list rather than a product of sums of it. B and C drop out entirely, which, as on the minterm page, says two of the inputs never affect the answer.
f := ΠM(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14) · output
Exact checks
Truth table (16 rows)
| # | A | B | C | D | f |
|---|---|---|---|---|---|
| 0 | FALSE | FALSE | FALSE | FALSE | TRUE |
| 1 | FALSE | FALSE | FALSE | TRUE | FALSE |
| 2 | FALSE | FALSE | TRUE | FALSE | TRUE |
| 3 | FALSE | FALSE | TRUE | TRUE | FALSE |
| 4 | FALSE | TRUE | FALSE | FALSE | TRUE |
| 5 | FALSE | TRUE | FALSE | TRUE | FALSE |
| 6 | FALSE | TRUE | TRUE | FALSE | TRUE |
| 7 | FALSE | TRUE | TRUE | TRUE | FALSE |
| 8 | TRUE | FALSE | FALSE | FALSE | FALSE |
| 9 | TRUE | FALSE | FALSE | TRUE | TRUE |
| 10 | TRUE | FALSE | TRUE | FALSE | FALSE |
| 11 | TRUE | FALSE | TRUE | TRUE | TRUE |
| 12 | TRUE | TRUE | FALSE | FALSE | FALSE |
| 13 | TRUE | TRUE | FALSE | TRUE | TRUE |
| 14 | TRUE | TRUE | TRUE | FALSE | FALSE |
| 15 | TRUE | TRUE | TRUE | TRUE | TRUE |
Plain-language reading
Beginnerf is true exactly when the truth-table row of (A, B, C, D) is none of the rows 1, 3, 5, 7, 8, 10, 12, and 14.
In every other case, f is false.
About the operators:
- ΠM lists the truth-table rows (maxterms) where the formula is false. Rows are numbered from 0 with the first listed input as the most significant bit.
Intermediatef is true exactly when the truth-table row of (A, B, C, D) is none of the rows 1, 3, 5, 7, 8, 10, 12, and 14.
In every other case, f is false.
Advancedf is true exactly when the truth-table row of (A, B, C, D) is none of the rows 1, 3, 5, 7, 8, 10, 12, and 14 [canonical product of maxterms (CNF)].
In every other case, f is false.
Formal notation: ΠM(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14)
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.
ΠM(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14)
Karnaugh map
- cells m0, m2, m4, m6
NOT A AND NOT D - cells m9, m11, m13, m15
A AND D
Minterms and maxterms
f(A, B, C, D) = Σm(0, 2, 4, 6, 9, 11, 13, 15)f(A, B, C, D) = ΠM(1, 3, 5, 7, 8, 10, 12, 14)Variable order: A, B, C, D · 16 rows
Normal forms
Conjunctive normal form (CNF)
(A OR B OR C OR NOT D) AND (A OR B OR NOT C OR NOT D) AND (A OR NOT B OR C OR NOT D) AND (A OR NOT B OR NOT C OR NOT D) AND (NOT A OR B OR C OR D) AND (NOT A OR B OR NOT C OR D) AND (NOT A OR NOT B OR C OR D) AND (NOT A OR NOT B OR NOT C OR D)8 clauses, 32 literals · complete · Maxterm expansion ×1
Disjunctive normal form (DNF)
(A AND B AND C AND D) OR (A AND B AND NOT C AND D) OR (A AND NOT B AND C AND D) OR (A AND NOT B AND NOT C AND D) OR (NOT A AND B AND C AND NOT D) OR (NOT A AND B AND NOT C AND NOT D) OR (NOT A AND NOT B AND C AND NOT D) OR (NOT A AND NOT B AND NOT C AND NOT D)8 terms, 32 literals · complete · Maxterm expansion ×1
NAND-only and NOR-only
NAND-only form
NAND(NAND(NAND(NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D))))), NAND(NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))))), NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D))))), NAND(NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D))))))), NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D)))))), NAND(NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))))), NAND(NAND(NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D)))))), NAND(NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))))))), NAND(NAND(NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D))))), NAND(NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))))), NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), NAND(B, B)), NAND(NAND(A, A), NAND(B, B))), NAND(NAND(C, D), NAND(C, D))))), NAND(NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D)))), NAND(NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(NAND(C, C), D), NAND(NAND(C, C), D))), NAND(NAND(NAND(NAND(A, A), B), NAND(NAND(A, A), B)), NAND(NAND(C, D), NAND(C, D))))))), NAND(NAND(NAND(NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D)))))), NAND(NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))))), NAND(NAND(NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, NAND(B, B)), NAND(A, NAND(B, B))), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D)))))), NAND(NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))), NAND(NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(NAND(C, C), NAND(D, D)), NAND(NAND(C, C), NAND(D, D)))), NAND(NAND(NAND(A, B), NAND(A, B)), NAND(NAND(C, NAND(D, D)), NAND(C, NAND(D, D))))))))))767 gates · verified equivalent on every row
NOR-only form
NOR(NOR(NOR(NOR(NOR(NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D))))), NOR(NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D)))))), NOR(NOR(NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D))))), NOR(NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D))))))), NOR(NOR(NOR(NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D))))), NOR(NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, B), NOR(A, B)), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D)))))), NOR(NOR(NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D))))), NOR(NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(C, NOR(D, D)), NOR(C, NOR(D, D)))), NOR(NOR(NOR(A, NOR(B, B)), NOR(A, NOR(B, B))), NOR(NOR(NOR(C, C), NOR(D, D)), NOR(NOR(C, C), NOR(D, D)))))))), NOR(NOR(NOR(NOR(NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D)))), NOR(NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D))))), NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D)))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D)))))), NOR(NOR(NOR(NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D)))), NOR(NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), B), NOR(NOR(A, A), B)), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D))))), NOR(NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D)))), NOR(NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(C, D), NOR(C, D))), NOR(NOR(NOR(NOR(A, A), NOR(B, B)), NOR(NOR(A, A), NOR(B, B))), NOR(NOR(NOR(C, C), D), NOR(NOR(C, C), D))))))))383 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: e6ef3ad9fe0105c241eb193f6c33bbe024b22c1fe5e09d4e5da659bfed0892bc
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:
'f' -> output_f(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})
# -> {'f': True}
model.output_f({'A': False, 'B': False, 'C': False, 'D': False})
# -> True
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_f",
]
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": "e6ef3ad9fe0105c241eb193f6c33bbe024b22c1fe5e09d4e5da659bfed0892bc",
"assumptions_digest": "d58ee1ad38e23e5093e4baa1047b5ae70d6972e08f555e34ac3fa16df63c4a78",
"primary_output": "f",
"unused_inputs": (),
"subcircuits": (),
}
# Stable ID -> generated identifier (reversible mapping; names are exact, escaped strings).
IDENTIFIER_MAP = {
"v_82bb4144cec7": {"kind": "input", "name": "A", "identifier": "input_A"},
"v_3ddb10a0dc62": {"kind": "input", "name": "B", "identifier": "input_B"},
"v_081c4d20cc51": {"kind": "input", "name": "C", "identifier": "input_C"},
"v_0c669d56d4da": {"kind": "input", "name": "D", "identifier": "input_D"},
"f_921487ed4790": {"kind": "output", "name": "f", "identifier": "output_f"},
}
INPUT_NAMES = ("A", "B", "C", "D")
OUTPUT_NAMES = ("f",)
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_f(input_A: bool, input_B: bool, input_C: bool, input_D: bool) -> bool:
"""Decision output 'f': \u03a0M(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14)"""
return minterm_index(input_A, input_B, input_C, input_D) not in (1, 3, 5, 7, 8, 10, 12, 14)
# ---- Public API ----
def output_f(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
"""Decision output 'f' (stable ID f_921487ed4790).
'f' := \u03a0M(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14)
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_f_value = _compute_output_f(values["A"], values["B"], values["C"], values["D"])
return output_f_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_f_value = _compute_output_f(values["A"], values["B"], values["C"], values["D"])
return {
"f": output_f_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: e6ef3ad9fe0105c241eb193f6c33bbe024b22c1fe5e09d4e5da659bfed0892bc
-- 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_82bb4144cec7: A -> "in_A"
-- v_3ddb10a0dc62: B -> "in_B"
-- v_081c4d20cc51: C -> "in_C"
-- v_0c669d56d4da: D -> "in_D"
-- Output columns:
-- f_921487ed4790: f -> "out_f"
-- 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_f] output f (stable ID f_921487ed4790)
-- f := \u03a0M(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14)
-- PRECONDITION: "in_A", "in_B", "in_C", "in_D" are non-NULL booleans.
-- (("in_A" OR "in_B" OR "in_C" OR (NOT "in_D")) AND ("in_A" OR "in_B" OR (NOT "in_C") OR (NOT "in_D")) AND ("in_A" OR (NOT "in_B") OR "in_C" OR (NOT "in_D")) AND ("in_A" OR (NOT "in_B") OR (NOT "in_C") OR (NOT "in_D")) AND ((NOT "in_A") OR "in_B" OR "in_C" OR "in_D") AND ((NOT "in_A") OR "in_B" OR (NOT "in_C") OR "in_D") AND ((NOT "in_A") OR (NOT "in_B") OR "in_C" OR "in_D") AND ((NOT "in_A") OR (NOT "in_B") OR (NOT "in_C") OR "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" OR "in_B" OR "in_C" OR (NOT "in_D")) AND ("in_A" OR "in_B" OR (NOT "in_C") OR (NOT "in_D")) AND ("in_A" OR (NOT "in_B") OR "in_C" OR (NOT "in_D")) AND ("in_A" OR (NOT "in_B") OR (NOT "in_C") OR (NOT "in_D")) AND ((NOT "in_A") OR "in_B" OR "in_C" OR "in_D") AND ((NOT "in_A") OR "in_B" OR (NOT "in_C") OR "in_D") AND ((NOT "in_A") OR (NOT "in_B") OR "in_C" OR "in_D") AND ((NOT "in_A") OR (NOT "in_B") OR (NOT "in_C") OR "in_D")) END AS "out_f"
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: e6ef3ad9fe0105c241eb193f6c33bbe024b22c1fe5e09d4e5da659bfed0892bc ; 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_82bb4144cec7: A -> in_A ; v_3ddb10a0dc62: B -> in_B ; v_081c4d20cc51: C -> in_C ; v_0c669d56d4da: D -> in_D ; f_921487ed4790: f -> out_f (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 f (stable ID f_921487ed4790): \u03a0M(A, B, C, D; 1, 3, 5, 7, 8, 10, 12, 14) (define-fun out_f () Bool (and (or in_A in_B in_C (not in_D)) (or in_A in_B (not in_C) (not in_D)) (or in_A (not in_B) in_C (not in_D)) (or in_A (not in_B) (not in_C) (not in_D)) (or (not in_A) in_B in_C in_D) (or (not in_A) in_B (not in_C) in_D) (or (not in_A) (not in_B) in_C in_D) (or (not in_A) (not in_B) (not 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
f = \prod M_{(A, B, C, D)}(1, 3, 5, 7, 8, 10, 12, 14)The common slip
Reading ΠM(…) as a list of true rows. The maxterm list names the zeros: row 1, A = FALSE, B = FALSE, C = FALSE, D = TRUE, is in the list, and the table shows the function false there. The minterm list of the same function is the complement, the eight rows not named.
Questions
Why do the NAND and NOR counts swap compared with the minterm page?
The two functions are duals in their expansions: an eight-term sum of products builds more naturally in NAND, an eight-clause product of sums in NOR. The converters report 383 and 767 on the minterm page and 767 and 383 here. Both are mechanical constructions, not shortest circuits.
Related
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
See also
- Maxterm: meaning and examples
- Maxterm expansion: the canonical product of sums (ΠM)
- Sum of products vs product of sums
- Four-variable K-map: Σm(0, 2, 5, 7, 8, 10, 13, 15) simplified
- Product of sums (POS): meaning and examples
- Minterms vs maxterms
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.