Logic Gate Sim

Mathematical Principles & Theorems

Simulates propositional logic circuits over \(\{0, 1\}\). Governed by Boolean algebraic identities: De Morgan's Laws (\(\overline{A \land B} = \bar{A} \lor \bar{B}\), \(\overline{A \lor B} = \bar{A} \land \bar{B}\)), idempotence (\(A \land A = A\)), absorption (\(A \lor (A \land B) = A\)), and involution (\(\overline{\bar{A}} = A\)). NAND and NOR form functionally complete universal gate sets capable of synthesizing any combinational circuit.

Operating Instructions

• Select or place logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR.
• Toggle input logic states (0 or 1) by clicking input terminals.
• Observe dynamic signal propagation and high/low voltage color coding through wires and gate junctions.
• Consult the live truth table readout to verify output state consistency.