Let be a set with two elements. The **category of Boolean functions** is the category whose objects are the finite powers of and whose morphisms are all functions between these sets. For a computer scientist, the morphisms of this category have the interpretation of functions which input and output finite sequences of bits.

Since this category has finite products and is freely generated under finite products by a single object, namely , it is a Lawvere theory.

**Question: **What are models of this Lawvere theory?