Disjunctive normal form (DNF) is an important concept in logic and computer science. It is a specific form of a logical formula that allows one to easily understand its structure and evaluate its truth value. Synonyms for DNF include conjunctive normal form (CNF), Boolean normal form, and sum-of-products (SOP). CNF is the dual representation of DNF, in which the formula is a conjunction of disjunctions. Boolean normal form is a more general term that encompasses both DNF and CNF. SOP is another specific representation of logical formulas, which utilizes the logical OR operation to combine terms. Using these synonyms interchangeably will help one better understand the basics of propositional logic.