# Universal Gate **A logic gate that can implement any [[Boolean Function|Boolean function]].** A **universal gate** is a logic gate that can be used to implement *any [[Boolean function]]*, typically by being combined to create the [[Boolean Algebra#Logical operations|basic logic gates]]. The most notable universal gates are NAND and NOR gates which can implement the basic logic gates by applying [[De Morgan's laws]]. NAND gates in particular require the least amount of transistors on CMOS chips and are thus the cheapest and easiest to manufacture. ## NAND logic ![[NANDLogic.svg]] *Implementation of a [[Negation|NOT]], [[Conjunction|AND]], and [[Disjunction|OR]] gate using only NAND gates.* ## NOR logic ![[NORLogic.svg]] *Implementation of a [[Negation|NOT]], [[Conjunction|AND]], and [[Disjunction|OR]] gate using only NOR gates.*