Source: https://guthlabs.ai/docs/instruments/boolean-logic-truth-table-generator/implementation/

instrument implementation / implementation-contract

# Boolean Logic Truth Table Generator implementation

A source-bound implementation contract for Boolean Logic Truth Table Generator; deployment and executable qualification remain separate.

Status: **VERIFIED_CLEAN**Lifecycle: **implementation-contract**

## Binding contract

This record describes what an executable surface must bind and validate. It does not claim that a public calculator, package, or production route is deployed.

**Record owner**: Guth Instruments

**Lifecycle**: verified-clean

**Evidence ID**: t6-032

**Effect**: Computation or source lookup only

## Input and validation requirements

- There are no physical units and no division-by-zero hazard in Boolean evaluation.

- A variable limit of approximately six must be enforced explicitly: 2^6 = 64 rows, while larger inputs grow exponentially.

- Duplicate variable names can make row generation and minterm numbering ambiguous; they should be rejected or normalized with a documented rule.

- Undeclared variables, malformed syntax, unmatched parentheses, and ambiguous operator precedence require deterministic parse errors rather than silent evaluation.

- NAND and NOR must be parsed with explicit operand grouping; implicit precedence can change the expression's meaning.

- The simplifier must preserve constants correctly: a contradiction has an empty minterm set and SOP 0, while a tautology has an empty maxterm set and SOP 1.

- If K-map grouping is advertised, the implementation must document variable ordering, adjacency rules, treatment of don't-care terms, and whether minimality is guaranteed.

## Required corrections

No binding erratum is attached to this unique-name record. Implementers must still preserve the declared units, domain, and failure behavior.

## Inspectable interface fixture

The sample below is evidence for interface and validation tests, not a production implementation.

````
{
  "inputs": {
    "expression": "NOT A",
    "variables": [
      "A"
    ]
  },
  "expected_outputs": {
    "truth_table": [
      {
        "A": false,
        "output": true
      },
      {
        "A": true,
        "output": false
      }
    ],
    "minterms": [
      0
    ],
    "maxterms": [
      1
    ],
    "simplified_SOP": "NOT A"
  },
  "working": "There are 2^1 = 2 rows. Row 0: A=0, so NOT A = NOT 0 = 1. Row 1: A=1, so NOT A = NOT 1 = 0. Therefore the output column is [1,0]. The true row is binary 0, so minterms = {0}; the false row is binary 1, so maxterms = {1}. The SOP is NOT A."
}
````

## Other records

[01**Overview**](<https://guthlabs.ai/docs/instruments/boolean-logic-truth-table-generator/>)[02**Mechanism**](<https://guthlabs.ai/docs/instruments/boolean-logic-truth-table-generator/mechanism/>)[04**Qualification**](<https://guthlabs.ai/docs/instruments/boolean-logic-truth-table-generator/qualification/>)

## Sources and evidence

These pointers bind the page to evidence. They do not grant authority or collapse verification into deployment.

- `VERIFIED_LEDGER.json`

- `evidence-tranche6/tranche6-results.json`