function, but a logic function can be represented by several logic formulas.
Boole’s expansion theorem [3, pp. 98] represents one way to guarantee that
there exists at least one logic formula for a logic function. Therefore, binary
logic functions are representable by logic formulas