BooleanFunction[k, n] represents the k\[Null]^th Boolean function in n variables. BooleanFunction[values] represents the Boolean function corresponding to the specified ...

BooleanVariables[expr] gives a list of the Boolean variables in the Boolean expression expr. BooleanVariables[bf] gives the number of Boolean variables in the BooleanFunction ...

BooleanMaxterms[k, n] represents the k\[Null]^th maxterm in n variables. BooleanMaxterms[{k_1, k_2, ...}, n] represents the conjunction of the maxterms k_i. ...

BooleanMinterms[k, n] represents the k\[Null]\[Null]^th minterm in n variables. BooleanMinterms[{k_1, k_2, ...}, n] represents the disjunction of the minterms k_i. ...

BooleanTable[bf] gives a list of truth values for all possible combinations of variable values supplied to the Boolean function bf. BooleanTable[expr, {a_1, a_2, ...}] gives ...

BooleanConvert[expr] converts the Boolean expression expr to disjunctive normal form. BooleanConvert[expr, form] converts the Boolean expression expr to the specified form. ...

Mathematica is the tool that has made possible Stephen Wolfram's exploration of the computational universe, and the emerging field of Wolfram Science (NKS). Whether for ...

BooleanGraph[bfunc, g_1, ..., g_n] gives the Boolean graph defined by the Boolean function bfunc on the graphs g_1, ..., g_n.

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 ...

SatisfiableQ[bf] gives True if a combination of values of variables exists that makes the Boolean function bf yield True. SatisfiableQ[expr, {a_1, a_2, ...}] gives True if a ...