NOR logic¶
Digital logic implemented with negated-disjunction gates, exploiting NOR's functional completeness to synthesize any Boolean function through NOR-only composition.
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.
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. Inclusion test: Require negated-disjunction gates as the construction primitive and, for NOR-only logic, composition that implements target Boolean functions. Exclusion test: Exclude OR gates, NAND-only synthesis, the abstract NOR connective when no gate or construction context is intended, and analog circuits operating outside declared Boolean levels. Nearest boundary: Logical NOR is the truth function itself; NOR logic emphasizes gate realization and composition, including the universal-basis consequence and implementation costs. Exit condition: The identity changes when another primitive is essential to the realization or when electrical behavior cannot be abstracted as valid Boolean NOR operations. Common misclassifications: 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. Nearest named distinctions: Logical NOR: Logical NOR is the abstract truth function; NOR logic adds gate-basis construction and implementation. NAND Logic: Both are universal single-gate bases, but their primitive truth functions and derived network costs differ. OR Gate: OR is true when any input is true; NOR complements that output. XNOR Gate: XNOR tests equality or even parity and may be constructed from multiple NOR gates but is not the primitive itself.
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¶
- Write the target function and chosen binary convention.
- Express negation and one complete connective using NOR compositions.
- Rewrite or synthesize the full function using NOR gates only.
- Verify equivalence by algebra, truth table, or formal checking.
- Measure depth, count, fan-in, load, and timing in the target technology.
- 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.
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
- Logical NOR — 0.92
- Switching circuit theory — 0.92
- Inverter Logic Gate — 0.89
- TC (Complexity) — 0.88
- Logic Circuit — 0.87
Computed from structural-signature embeddings · 2026-10-08