Product Design, Manufacturing & Innovation Resources
Home » De Morgan’s Laws

De Morgan’s Laws

1850
  • Augustus De Morgan
Digital circuit design workspace showcasing De Morgan's Laws in Boolean algebra.

(generated image for illustration only)

De Morgan’s laws are a pair of transformation rules in Boolean algebra that are fundamental to digital circuit design. The first law states that the negation of a conjunction is the disjunction of the negations: \(\neg(P \land Q) \iff (\neg P) \lor (\neg Q)\). The second states that the negation of a disjunction is the conjunction of the negations: \(\neg(P \lor Q) \iff (\neg P) \land (\neg Q)\).

In the context of digital electronics, De Morgan’s laws provide a powerful tool for circuit manipulation. They establish a direct equivalence between different types of logic gates. For example, the first law, \(\neg(A \cdot B) = \neg A + \neg B\) (using dot for AND and plus for OR), shows that a NAND gate is equivalent to an OR gate with inverted inputs. Similarly, the second law, \(\neg(A + B) = \neg A \cdot \neg B\), shows that a NOR gate is equivalent to an AND gate with inverted inputs. This interchangeability is extremely practical. Since NAND and NOR gates are “universal gates”—meaning any Boolean function can be implemented using only NAND gates or only NOR gates—De Morgan’s laws are essential for converting a circuit design from a mix of AND, OR, and NOT gates into a design using a single gate type. This simplifies the manufacturing process for integrated circuits, as only one type of logic cell needs to be perfected and replicated. The laws are also used extensively in logic synthesis software to optimize circuits for speed, area, or power consumption by transforming and simplifying the underlying Boolean expressions.

UNESCO Nomenclature: 1202
– Computer science

Type

Abstract System

Disruption

Substantial

Usage

Widespread Use

Precursors

  • Aristotelian logic
  • George Boole’s formulation of symbolic logic
  • Work on duality in algebra and logic by earlier mathematicians

Applications

  • simplification of boolean expressions in circuit design
  • conversion between and-or logic and nand/nor logic
  • compiler optimization in software
  • database query optimization
  • formal verification of digital systems

Patents:

NA

Potential Innovations Ideas

Due to scrapping bot traffic, currently more than 40k per day, this content is reserved to community members.
> Login < or > Register < (100% free) to access this, so as all other restricted content and tools.

Related to: de morgan’s laws, boolean algebra, logic simplification, nand gate, nor gate, universal gates, digital logic, set theory.

Historical Context

De Morgan’s Laws

1822
1827
1829
1850
1854
1854
1895
1822
1822
1828
1848
1850
1854
1884
1896

(if date is unknown or not relevant, e.g. "fluid mechanics", a rounded estimation of its notable emergence is provided)

Related Invention, Innovation & Technical Principles

Full size images and downloads are only available, 100% free, for registered members.

> Login <