Boolean-nand
Formalization and verification of a circuit
for boolean negated conjunction.
Given two field elements x and y representing booleans
(i.e. such that each field element is either 0 or 1;
see boolean-assert),
their negated conjunction z is obtained via
a multiplication of the form
which defines z to be 0 if both x and y are 1, otherwise 1.
Thus, z is boolean (0 or 1) if both x and y are.
This has the same form as boolean-and,
but with the result boolean negated (see boolean-not).
Subtopics
- Boolean-nand-spec
- Specification of the circuit.
- Boolean-nand-circuit
- Construction of the circuit.
- Boolean-nand-correctness
- Correctness of the circuit.
- Boolean-nand-lifting
- Lifting of the circuit to a predicate.
