Skip to content

NOR logic

Digital logic implemented with negated-disjunction gates, exploiting NOR's functional completeness to synthesize any Boolean function through NOR-only composition.

Version
v1 · 2026-09-28 · History
Domain-specific #
11024
Domain group
Applied Sciences & Engineering
Origin domain
Engineering & Design (beyond software)
Subdomains
Digital Logic Design, Electrical Engineering → Engineering & Design (beyond software)

Core Idea

A NOR gate computes the complement of OR. For two inputs it is high only at the all-false row, and for multiple inputs it is high only when none is high. This truth function is functionally complete: appropriate compositions can reproduce NOT, OR, AND, and every Boolean expression.

NOR logic can mean more than the single connective. It describes a basis-restricted construction discipline and its physical realization. A logically correct network can still differ substantially in gate count, propagation depth, loading, power, and hazards, so universality and engineering suitability must be reported separately.

Structural Signature

Sig role-phrases:

  • Binary inputs — Supply Boolean truth values to each gate instance. It is carrier. Counterfactual: Analog behavior requires a separate electrical interpretation around the logic abstraction.
  • Negated disjunction — Maps an input tuple to true exactly when no input is true. It is primitive. Counterfactual: OR without output inversion is a different function.
  • Gate composition — Feeds NOR outputs into later NOR inputs to form larger expressions. It is operation. Counterfactual: An isolated gate does not demonstrate the NOR-only construction method.
  • Functional completeness — Guarantees that every Boolean function has a NOR-only realization. It is invariant. Counterfactual: A restricted primitive set unable to express negation or conjunction would not be universal.
  • Logical equivalence proof — Shows the composed network implements its target truth function. It is validity. Counterfactual: Visual resemblance or naming cannot replace truth-table equivalence.
  • Physical implementation cost — Adds fan-in, delay, power, loading, hazards, and technology constraints. It is domain frame. Counterfactual: Logical universality does not imply an equally efficient or robust circuit.

What It Is Not

  • It is not OR logic with a verbal negative condition.
  • It is not identical to NAND-only logic, despite both being universal.
  • It is not every circuit that happens to contain one NOR gate.
  • Functional completeness does not imply minimum gate count or delay.
  • Closest near-miss. Logical NOR is the truth function itself; NOR logic emphasizes gate realization and composition, including the universal-basis consequence and implementation costs.

Scope of Application

  • Boolean synthesis. Rewrites arbitrary expressions into networks using one universal primitive.
  • Digital circuit education. Demonstrates De Morgan duality and functional completeness constructively.
  • Gate-level implementation. Maps a logic design into NOR-compatible cells under technology constraints.
  • Historical computing. Explains systems built from a deliberately uniform gate family.

Clarity

Provide the truth convention, arity, target Boolean function, NOR-only netlist, and equivalence proof. For hardware, also state voltage family, fan-in and fan-out, delay, power, and hazard assumptions. Do not infer physical performance from logical universality.

Manages Complexity

The abstraction reduces a heterogeneous gate library to one compositional primitive. That yields a clean completeness proof and uniform implementation vocabulary, while the separation of truth function, synthesis network, and electrical realization exposes costs hidden by Boolean equivalence.

Abstract Reasoning

  1. Write the target function and chosen binary convention.
  2. Express negation and one complete connective using NOR compositions.
  3. Rewrite or synthesize the full function using NOR gates only.
  4. Verify equivalence by algebra, truth table, or formal checking.
  5. Measure depth, count, fan-in, load, and timing in the target technology.
  6. Revise the network if physical constraints invalidate the ideal logic abstraction.

Knowledge Transfer

The transferable cargo is functionally complete composition from negated disjunction. It transfers across relay, transistor, standard-cell, and formal-logic substrates when binary levels and composition are preserved; it stops at analog regimes or at networks whose claimed completeness depends on another primitive.

Examples

Canonical

Tying the inputs of one NOR gate realizes NOT; NORing an input pair and then NOR-inverting that result realizes OR, from which additional NOR networks synthesize arbitrary Boolean functions.

Mapped back: primitive → NOR; composition → NOR only; targets → NOT and OR; proof → truth equivalence.

Applied / In Practice

A standard-cell circuit contains a NOR gate among NAND, inverter, and complex gates; it uses NOR but is not a NOR-only logic basis.

Mapped back: NOR → present; exclusive basis → absent.

Structural Tensions

T1 — Single Universal Primitive versus Circuit Efficiency. Uniformity simplifies a logical basis while increasing depth or gate count for some functions.

Diagnostic: How does the NOR realization compare in delay, area, power, and fan-in?

T2 — Boolean Equivalence versus Electrical Nonideality. Truth tables abstract away thresholds, rise times, noise, and hazards that can defeat hardware behavior.

Diagnostic: Which physical constraints preserve the intended Boolean levels under composition?

Structural–Framed Character

NOR Logic is hybrid: structurally a universal Boolean basis and framed by digital-gate implementation constraints.

Structural Core vs. Domain Accent

The core is one truth function closed under composition strongly enough to express all Boolean functions. Digital engineering supplies logic levels, gates, delay, fan-in, loading, hazards, standard cells, and the distinction between a connective and a physical circuit.

  • Approved root. The frozen graph keeps the gate-basis identity unparented despite close relation to the abstract logical-NOR node.

  • Related — logical NOR, OR, NAND logic, De Morgan's laws, functional completeness, and Boolean circuit. These supply the function, dual basis, equivalence, and implementation setting.

Neighborhood in Abstraction Space

NOR logic sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Digital Logic & Finite-State Machines (10 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Logical NOR. Tell: Logical NOR is the abstract truth function; NOR logic adds gate-basis construction and implementation.
  • NAND Logic. Tell: Both are universal single-gate bases, but their primitive truth functions and derived network costs differ.
  • OR Gate. Tell: OR is true when any input is true; NOR complements that output.
  • XNOR Gate. Tell: XNOR tests equality or even parity and may be constructed from multiple NOR gates but is not the primitive itself.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/NOR_logic (revision 1349810797).
  • Preserved source candidate: https://www.electronics-tutorials.ws/logic/logic_6.html

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.