Module 2 — Boolean Equivalence and Canonical Forms

Prove two circuits equivalent with a miter: mux implementations, a majority voter, and parity in canonical sum-of-products form.

Katas in this module (3)

• Kata 2.1 — Mux Equivalence
• Kata 2.2 — Majority Voter
• Kata 2.3 — Parity Canonical SOP

Part of Discrete Mathematics for Formal Verification on formal.org.