Boolean Functions
In Boolean algebra, a monotonic function is one such that for all ai and bi in {0,1}, if a1 ≤ b1, a2 ≤ b2, ..., an ≤ bn, then f(a1, ..., an) ≤ f(b1, ..., bn). In other words, a Boolean function is monotonic if, for every combination of inputs, switching one of the inputs from false to true can only cause the output to switch from false to true and not from true to false. Graphically, this means that a Boolean function is monotonic when in its Hasse diagram (dual of its Venn diagram), there is no 1 (red vertex) connected to a higher 0 (white vertex).
The monotonic Boolean functions are precisely those that can be defined by an expression combining the inputs (which may appear more than once) using only the operators and and or (in particular not is forbidden). For instance "at least two of a,b,c hold" is a monotonic function of a,b,c, since it can be written for instance as ((a and b) or (a and c) or (b and c)).
The number of such functions on n variables is known as the Dedekind number of n.
Read more about this topic: Monotonic Function
Famous quotes containing the word functions:
“When Western people train the mind, the focus is generally on the left hemisphere of the cortex, which is the portion of the brain that is concerned with words and numbers. We enhance the logical, bounded, linear functions of the mind. In the East, exercises of this sort are for the purpose of getting in tune with the unconscious—to get rid of boundaries, not to create them.”
—Edward T. Hall (b. 1914)