Disjunctive normal form¶

A Boolean formula represented as a disjunction of conjunctions of literals—an OR of AND terms.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4214
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Boolean Logic → Mathematics
Aliases: DNF, Sum of products

Core Idea¶

Ordinary DNF need not contain every variable in every term, canonical or full DNF does, satisfiable formulas can have many nonequivalent-sized DNF expressions, and conversion by distributivity may grow exponentially. Negations are pushed to literals and distributive laws expand combinations so each satisfying case appears as a conjunction; their disjunction preserves the original truth function. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The OR-List of AND-Groups

Imagine a rule for when you can go to the park: "It's sunny AND I finished lunch, OR it's Saturday AND Grandma is here." Each part is a list of things that all must be true, and you only need one part to work. Writing a rule that way, as "this group OR that group," is called disjunctive normal form.

ORs of ANDs

In logic, statements can be true or false, and we combine them with AND, OR, and NOT. Disjunctive normal form, or DNF, is a standard way to write any such combination: a list of groups joined by OR, where each group is some simple pieces joined by AND, and NOT only sits right in front of a single piece. Each group describes one situation where the whole thing is true. Any true-or-false rule can be rewritten this way without changing when it's true. But turning a rule into DNF can sometimes make it much, much longer.

Sum-of-Products Logic Form

Disjunctive normal form (DNF) writes a Boolean formula as an OR of terms, where each term is an AND of literals, a literal being a variable or its negation. Any formula can be converted to DNF by pushing negations inward until they sit on single variables and then using the distributive law to expand; the result has exactly the same truth table. Each term describes one family of satisfying cases. In ordinary DNF a term does not have to mention every variable, whereas in canonical or full DNF every term mentions every variable and corresponds to exactly one satisfying assignment, called a minterm. The same formula can have many DNF versions of very different sizes, and converting by distribution can make the formula grow exponentially. DNF is the mirror image, or dual, of conjunctive normal form, which is an AND of ORs.

A Boolean formula is in disjunctive normal form (DNF) if it is a disjunction of conjunctive terms, each term a conjunction of literals (variables or their negations). Conversion proceeds by moving negations to the literals, yielding negation normal form, and then applying distributivity of AND over OR, so that each way of satisfying the formula appears as a conjunction; the disjunction of these preserves the original truth function. Ordinary DNF allows terms that omit variables, while canonical (full) DNF requires every term to mention every variable, making the terms exactly the minterms corresponding to satisfying assignments. A satisfiable formula can have many equivalent DNF expressions of very different sizes, and simplifications such as absorption remove redundant terms. Conversion by distribution can blow up exponentially in formula size. DNF is dual to conjunctive normal form (CNF), an AND of ORs, via De Morgan's laws.

Scope of Application¶

Disjunctive normal form belongs to boolean logic and is useful where the analyst can specify the typed boolean logic carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the Boolean variables and literals, conjunction terms and outer disjunction, negation-normal assumptions, truth-functional equivalence, ordinary versus canonical or full DNF, minterms and satisfying assignments, conversion rules, redundancy and absorption, size complexity and duality with conjunctive normal form are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the Boolean variables and literals, conjunction terms and outer disjunction, negation-normal assumptions, truth-functional equivalence, ordinary versus canonical or full DNF, minterms and satisfying assignments, conversion rules, redundancy and absorption, size complexity and duality with conjunctive normal form are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Disjunctive normal form. Disjunctive normal form compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed boolean logic carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the Boolean variables and literals, conjunction terms and outer disjunction, negation-normal assumptions, truth-functional equivalence, ordinary versus canonical or full DNF, minterms and satisfying assignments, conversion rules, redundancy and absorption, size complexity and duality with conjunctive normal form are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of boolean logic because they reuse the typed boolean logic carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Negations are pushed to literals and distributive laws expand combinations so each satisfying case appears as a conjunction; their disjunction preserves the original truth function., and type the carrier, state every parameter and convention in the definition, test that the Boolean variables and literals, conjunction terms and outer disjunction, negation-normal assumptions, truth-functional equivalence, ordinary versus canonical or full DNF, minterms and satisfying assignments, conversion rules, redundancy and absorption, size complexity and duality with conjunctive normal form are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Disjunctive normal form Domain-specific

Parents (1) — outgoing typed relations

Disjunctive normal form is a kind of Representation Prime

It remains its own entry because its identity is fixed by the Boolean variables and literals, conjunction terms and outer disjunction, negation-normal assumptions, truth-functional equivalence, ordinary versus canonical or full DNF, minterms and satisfying assignments, conversion rules, redundancy and absorption, size complexity and duality with conjunctive normal form.

Hierarchy path (1) — routes to 1 parentless root

Disjunctive normal form → is a kind of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Disjunctive normal form sits in a crowded region of the domain-specific corpus (5^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Boolean & Formal Logic Structures (29 abstractions)

Nearest neighbors

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