
doi: 10.1109/12.2225
We consider special ternary logic functions: the regular functions suitable for treating ambiguity and the majority functions based on an extended majority principle. The main subjects are: there is a one-to-one correspondence between the n-ary monotone regular ternary logic functions and the \((n+1)\)-ary monotone Boolean functions. Similarly, there is a one-to-one correspondence between the n-ary monotone ternary majority functions and the \((n+1)\)-ary monotone binary threshold functions.
monotone Boolean functions, threshold functions, Switching theory, application of Boolean algebra; Boolean functions, ambiguity, majority functions
monotone Boolean functions, threshold functions, Switching theory, application of Boolean algebra; Boolean functions, ambiguity, majority functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
