Correctness of gate clauses
Lax429075.GateCorrect · concepts/Lax429075/GateCorrect.lean · lax-429075
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
The clauses for one gate hold exactly when its output agrees with its Boolean operation.
Concept map
In the paper
- page 2 of this submission's paper
Lean source view on GitHub
| 1 | import Lax429075.Tseitin |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Correctness of gate clauses |
| 6 | type: lemma |
| 7 | --- |
| 8 | The clauses for one gate hold exactly when its output agrees with its |
| 9 | Boolean operation. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax429075.GateCorrect |
| 13 | |
| 14 | open CNF Circuits Tseitin |
| 15 | |
| 16 | axiom correct (i : ℕ) (g : Gate) (ρ : Assignment) : |
| 17 | eval (gateClauses i g) ρ = g.check ρ i |
| 18 | |
| 19 | end Lax429075.GateCorrect |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments