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:
“Nobody is so constituted as to be able to live everywhere and anywhere; and he who has great duties to perform, which lay claim to all his strength, has, in this respect, a very limited choice. The influence of climate upon the bodily functions ... extends so far, that a blunder in the choice of locality and climate is able not only to alienate a man from his actual duty, but also to withhold it from him altogether, so that he never even comes face to face with it.”
—Friedrich Nietzsche (1844–1900)