Logical NOR¶
The Boolean connective that is true exactly when all its operands are false, equivalently the negation of disjunction; repeated NOR alone is functionally complete for propositional logic.
Core Idea¶
NOR denies that any input is true. Its binary truth table has exactly one true case, and De Morgan's law identifies it with the conjunction of the negated operands.
Its importance exceeds one connective: self-NOR gives negation, and further compositions construct OR, AND, and every Boolean function. Hardware and software realizations preserve the truth function only under declared width, polarity, and state conventions.
Structural Signature¶
Sig role-phrases:
- Boolean operands — Supply truth values or propositions. It is inputs. Counterfactual: Arity must be stated for gates beyond binary.
- Disjunction — Combines inputs as true when any is true. It is inner operation. Counterfactual: NOR negates its result.
- Negation — Reverses the OR output. It is outer operation. Counterfactual: It applies to the whole disjunction.
- Truth table — Defines the operator extensionally. It is semantics. Counterfactual: Only the all-false input row yields true.
- NOR expression — Composes repeated NOR operations to realize other connectives. It is functional basis. Counterfactual: Circuit cost depends on fan-in and implementation.
- NOR gate — Implements the Boolean operation in hardware under electrical conventions. It is physical realization. Counterfactual: Logical truth and voltage levels must be mapped explicitly.
What It Is Not¶
- It is not NAND.
- It is not XNOR or logical equivalence.
- It negates the whole disjunction, not merely one operand.
- Logical NOR and bitwise NOR require different operand domains.
- Closest near-miss. XNOR is true when inputs are equal, including the both-true row; NOR is true only on the all-false row.
Scope of Application¶
- Propositional logic. Defines joint denial and functional bases.
- Boolean algebra. Supports identities and normal-form transformations.
- Digital logic. Implements NOR gates and NOR-only circuits.
- Programming and bit operations. Applies elementwise to fixed-width bit patterns when defined.
Clarity¶
State operands and arity, truth-value system, inclusive OR, notation and precedence, proposition or bit-vector domain, word width and signedness, unknown-state handling, desired truth table, hardware polarity and voltage mapping, fan-in, propagation timing, gate-count/depth metric, and whether a named symbol denotes NOR or XNOR in the source.
Manages Complexity¶
A tiny truth table can produce large compositional expressions. Many-valued hardware states, active-low naming, bit widths, and ambiguous symbols create errors outside ideal Boolean semantics.
Abstract Reasoning¶
- Fix the operand domain, arity, and truth-value convention.
- Compute inclusive disjunction of all operands.
- Negate that result and verify the all-false true row.
- Use algebraic identities or truth tables to transform larger expressions.
- For implementation, map truth to physical or bit-level states and evaluate cost and timing.
Knowledge Transfer¶
Functional-basis reasoning transfers to NAND and other complete operator sets. Binary NOR identities do not transfer unchanged to fuzzy, probabilistic, quantum, or multivalued logics without defining their disjunction and negation.
Examples¶
Canonical¶
For p=false and q=false, p OR q is false and its negation is true; for every other binary input, at least one operand is true and NOR returns false.
Mapped back: inputs → false,false; OR → false; NOR → true; other rows → false.
Applied / In Practice¶
An equivalence gate returns true for both false/false and true/true. That is XNOR, not NOR, because NOR rejects the both-true row.
Mapped back: operation → equivalence; true rows → 00 and 11; verdict → XNOR.
Structural Tensions¶
T1 — Single-Operator Completeness versus Expression Size. NOR alone provides a uniform basis while derived functions can require more gates and depth than mixed libraries.
Diagnostic: What cost metric matters for the implementation?
T2 — Formal Simplicity versus Physical Convention. The Boolean definition is invariant while voltage polarity, timing, fan-in, and noise determine actual gate behavior.
Diagnostic: Which logic-level mapping implements true and false?
Structural–Framed Character¶
Logical NOR is structural as negated disjunction with one all-false true case and framed by Boolean truth-function semantics.
Structural Core vs. Domain Accent¶
The broad pattern is an operator. Boolean logic adds truth tables, De Morgan duality, functional completeness, symbolic scope, circuit gates, and a distinction between logical and bitwise domains.
Instantiates / Related Primes¶
This entry presupposes Boolean algebra.
-
Approved Boolean-operator root. No frozen parent entails negated disjunction and its functional completeness.
-
Related — disjunction, negation, NAND, XNOR, Boolean algebra, functional completeness, NOR gate, Peirce arrow, and bitwise NOR. They are constituents, dual/near-miss, algebra, property, notation, implementation, and domain variant.
Relationships to Other Abstractions¶
Current abstraction Logical NOR Domain-specific
Parents (1) — more general patterns this builds on
-
Logical NOR presupposes Boolean algebra Domain-specific
Logical NOR presupposes Boolean algebra: the parent's defining role is necessary to the child's frozen mechanism or criterion.The reviewed Logical NOR identity—The Boolean connective that is true exactly when all its operands are false, equivalently the negation of disjunction; repeated NOR alone is functionally complete for propositional logic—requires the structural role carried by Boolean algebra—An algebraic structure with conjunction, disjunction and complementation satisfying laws that model two-valued logic and set operations; removing that role makes the child mechanism or criterion undefined. Boolean algebra can occur in settings that do not instantiate Logical NOR, so this is dependency rather than subsumption.
Hierarchy path (1) — routes to 1 parentless root
- Logical NOR → Boolean algebra → Representation → Abstraction
Neighborhood in Abstraction Space¶
Logical NOR sits in a crowded region of the domain-specific corpus (25th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Logical Connectives & Formal Systems (13 abstractions)
Nearest neighbors
- NOR logic — 0.92
- Logical or — 0.91
- Switching circuit theory — 0.91
- Logical Operation — 0.89
- Ternary Operation — 0.88
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- NAND. Tell: Negates conjunction and is false only when all inputs are true.
- XNOR. Tell: Returns true when inputs are equal.
- OR. Tell: Returns true when at least one input is true.
- Bitwise NOR. Tell: Applies NOR independently at each bit position of fixed-width operands.
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Logical_NOR (revision 1341314729).
- Preserved source candidate: https://richardzach.org/2023/02/sheffer-stroke-before-sheffer-edward-stamm/
- Preserved source candidate: https://aplwiki.com/wiki/Nor
- Preserved source candidate: https://books.google.com/books?id=M-5m_EdvxuIC
- Preserved source candidate: https://hsm.stackexchange.com/questions/5680/who-is-donald-l-webb
- Preserved source candidate: https://web.archive.org/web/20230518155850/https://hsm.stackexchange.com/questions/5680/who-is-donald-l-webb
- Preserved source candidate: http://archive.org/details/mathematicallogi00quin
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.