Suppose that a truth table in n propositional variables is specified, Show that a compoun...

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, will one conjunction included for each combination of values for which the compound proposition is true. The resulting compound proposition is said to be in disjunctive normal form.

A collection of logical operators is called functionally complete if every compound proposition is logically equivalent to a compound proposition involving only these logical operators.