Skip to content

OR from NOR gates: A OR B = NOR(NOR(A, B), NOR(A, B))

OR from NOR gates: A OR B = NOR(NOR(A, B), NOR(A, B)), a NOR followed by a NOR inverter.

Engine name: OR as NORFR: OR en NORDE: OR als NOR

OR is built as the negation (a NOR with tied inputs) of a NOR.

A NOR is an OR with its output inverted; inverting again restores the OR. The inverter is the tied NOR of the previous law, so the construction uses two gates, with the inner NOR appearing twice in the text because the text cannot show that its single output feeds both inputs of the second gate.

The construction is the exact dual of AND from NAND, and the engine proves it the same way, on the four rows over A and B. The NOR-only converter reports gate counts on this basis, and the comparison page sets the NAND and NOR counts for one rule side by side.

The proof is below.

Statement

A OR B = NOR(NOR(A, B), NOR(A, B))

Proof by truth table: A OR B = NOR(NOR(A, B), NOR(A, B))

A OR B = NOR(NOR(A, B), NOR(A, B))
#ABlhsrhs
0FALSEFALSEFALSEFALSE
1FALSETRUETRUETRUE
2TRUEFALSETRUETRUE
3TRUETRUETRUETRUE
lhs ≡ rhs holds · lhs and rhs agree on every assignment. · Exhaustively checked and solver cross-checked · 4 rows

The same law in four notations

WordsA OR B
ProgrammingA || B
MathematicalA ∨ B
AlgebraA + B
LaTeXA + B
WordsNOR(NOR(A, B), NOR(A, B))
ProgrammingNOR(NOR(A, B), NOR(A, B))
MathematicalNOR(NOR(A, B), NOR(A, B))
AlgebraNOR(NOR(A, B), NOR(A, B))
LaTeX\overline{\overline{A + B} + \overline{A + B}}
A OR B = NOR(NOR(A, B), NOR(A, B)) A OR B = NOR(NOR(A, B), NOR(A, B)) A B lhsPRIMARY rhs OR NOR NOR NOR
A OR B = NOR(NOR(A, B), NOR(A, B)) A OR B = NOR(NOR(A, B), NOR(A, B)) A B lhsPRIMARY rhs OR NOR NOR NOR

The common slip

Expecting one NOR to be an OR. A single NOR is the negation of the OR; the second gate is the inverter that restores it.

Questions

Is the NOR family used in practice?

Yes; which gate is cheaper depends on the technology. CMOS NAND gates are usually faster than NOR gates of the same size, which is one reason NAND is the more common choice, but both families appear in real designs.

Related

Lesson that teaches this

Tools

Practice

See also

Laws

Generated from the Tangibool engine, semantics tangibool-semantics/1, engine 1.0.0, build . Every table, map, simplification and verdict on these pages was computed by the Tangibool engine when the site was built, and every claim was re-checked by the same exact checker the app uses. Limits are stated where they apply. © 2026 Foreranger LTD.