Here is a problem from Kenneth Rosen's Discrete Mathematics and its Applications, Section 1.3
Suppose that a truth table in $n$ propositional variables is specified. Show that a compound proposition with this truth table can be formed by taking the disjunction of conjunctions of the variables or their negations, with one conjunction included for each combination of values for which the compound proposition is true. The resulting compound proposition is said to be disjunctive normal form.
I have been stuck in this question for quite some time and I would really appreciate a nudge in the right direction.
This is a homework problem and I am not expecting a complete answer. However, what I would like is to get a feel of what a Disjunctive Normal form is. I have been looking it up on the internet but no explanation is a good enough explanation for me. I would really appreciate an explanation.
Thanks a lot!