I'm looking for the disjunctive normal form of an expression with TFFTTFFT as its truth table, but it isn't really necessary to now what exactly that expression is . talk ) 17 : 33, 9 November 2011 ( UTC)
22.
Furthermore, if they are restricted to being in "'full disjunctive normal form "', in which every variable appears exactly once in every conjunction, they can be checked in constant time ( each conjunction represents one satisfying assignment ).
23.
A positive function of a given system of variables, that uses all of its variables, is read-once if and only if every prime implicant of the disjunctive normal form and every clause of the conjunctive normal form have exactly one variable in common.
24.
One way is to use disjunctive normal form :'( the first is true and the rest are false ) OR ( the second is true and the rest are false ) OR . . . OR ( the tenth is true and the rest are false ) '.
25.
The existence of negation normal forms drives many applications, for example in digital circuit design, where it is used to manipulate the types of logic gates, and in formal logic, where it is needed to find the conjunctive normal form and disjunctive normal form of a formula.
26.
The " n "-variable parity function and its negation are the only Boolean functions for which all disjunctive normal forms have the maximal number of 2 " n " & minus; 1 monomials of length " n " and all conjunctive normal forms have the maximal number of 2 " n " & minus; 1 clauses of length " n ".
