The p-valued-input, q-valued-output threshold logic and its application to the synthesis of p-valued logical networks (Q800309): Difference between revisions

In this paper, a concept of p-valued input, q-valued-output threshold logic is proposed, motivated by the possibility to use threshold elements for the realization of many-valued logic networks. Universal threshold functions are defined and it is shown that a p-adic function is universal. Next, a (p,q)-adic-min-max scheme is proposed for the realization of p-valued logical networks and the cost of such networks is analyzed. It is shown that in a restricted situation, the optimum value of q can be determined in order to construct the minimum cost p-valued network, using the (p,q)-threshold elements. (p,q)-logical completeness is considered and a condition for completeness, which is almost equivalent to the q-valued logical completeness, is found. Finally, some further developments required by the physical implementation of the proposed logic are discussed.