In
mathematics and
logic, a
(finitary) Boolean function (or switching function) is a
function of the form
ƒ :
Bk →
B, where
B = {0, 1} is a
Boolean domain and
k is a non-negative integer called the
arity of the function. In the case where
k = 0, the "function" is essentially a constant element of
B.