Home /permanent

Boolean Function

Boolean Function is a function that maps one or more Boolean input values (true/false, or 1/0) to a single Boolean output value. With nn inputs, it can be written as f:{0,1}n→{0,1}f: \{0, 1\}^n \rightarrow \{0, 1\}.

A Boolean function can be represented as a truth table (there's only one truth table for each function), as a Boolean Expression, or as a circuit of Logic Gate.

A Karnaugh Map is a graphical way to represent and simplify a Boolean function. See Boolean Algebra.