SatisfiabilityCount[bf] counts the number of possible combinations of variable values that yield True when supplied as arguments to the Boolean function ...

TautologyQ[bf] gives True if all combinations of values of variables make the Boolean function bf yield True.TautologyQ[expr, {a_1, a_2, ...}] gives True if all combinations ...

Building on its core symbolic architecture, Mathematica gives immediate access to the latest in industrial-strength Boolean computation. With highly general symbolic ...

Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...

Implies[p, q] represents the logical implication p \[DoubleRightArrow] q.

Mathematica 7 represents another major achievement in Mathematica's long history of innovation in mathematics and algorithms. Building on the broad capabilities of ...

Equivalent[e_1, e_2, ...] represents the logical equivalence e_1 \[DoubleLeftRightArrow] e_2 \[DoubleLeftRightArrow] ..., giving True when all of the e_i are the same.

BooleanMinimize[expr] finds a minimal-length disjunctive normal form representation of expr.BooleanMinimize[expr, form] finds a minimal-length representation for expr in the ...

Conjunction[expr, {a_1, a_2, ...}] gives the conjunction of expr over all choices of the Boolean variables a_i.

Disjunction[expr, {a_1, a_2, ...}] gives the disjunction of expr over all choices of the Boolean variables a_i.