Implicant (source code)

= Implicant

A <logical conjunction> $T$ of <literals> is an implicant of a <Boolean function> $f$ if every <Boolean valuation> making $T$ true also makes $f$ true. Every term in a <disjunctive normal form> is an <implicant> of the represented <Boolean function>. To rule out a one-<literal> term, it suffices to find a false <Boolean valuation> of $f$ where that <literal> is true.