Unate function

From formulasearchengine
Revision as of 20:09, 18 February 2013 by (talk)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A unate function is a type of boolean function which has monotonic properties. They have been studied extensively in switching theory.

A function is said to be positive unate in if for all ,

Likewise, it is negative unate in if

If for every f is either positive or negative unate in the variable then it is said to be unate (note that some may be positive and some negative to satisfy the definition of unate). A function is binate if it is not unate (i.e., is neither positive nor negative in at least one of its variables).

For example the Logical disjunction function or with boolean values are used for true (1) and false (0) is positive unate.

NB: positive unateness can also be considered as passing the same slope (no change in the input) and negative unate is passing the opposite slope.... non unate is dependence on more than one input (of same or different slopes)

  1. REDIRECT Template:Prog-lang-stub