Final answer:
The statement that a Boolean expression is in disjunctive normal form (DNF) if it is a sum of product terms is true. DNF is a canonical form that represents Boolean expressions uniquely and disjunctive syllogism is a related form of valid deductive inference in logic.
Step-by-step explanation:
A Boolean expression is in disjunctive normal form (DNF) if it is indeed represented as a sum of product terms. The answer is true. The DNF is a canonical form of a Boolean expression, meaning it is a standard and unique way to represent a Boolean expression. In DNF, a Boolean expression is a disjunction (logical OR) of one or more conjunctions (logical AND) of literals (variables or their negations). For example, the expression (A ∧ B) ∨ (C ∧ ¬D) is in DNF because it is the sum (OR) of product (AND) terms.
Valid Deductive Inferences
In logic, a disjunctive syllogism is a form of valid deductive inference. If you have a statement like "Either X or Y is true, X is not true, therefore Y must be true," it is an example of disjunctive syllogism. Such inferences are part of determining logical truth and can be represented in Boolean expressions through DNF.