An application of the (p, q)-logic to the synthesis of the p-valued logical networks and the s-(p, q)-logical completeness

The p-valued input, q-kind-valued output logic (say, the (p, q)-logic) is a pplied to construct the low cost p-valued logical networks. Next, the s - ( p, q)-logical completeness is derived (0 less than or equal to s less than or equal to q). As a result, some relations between the parameter s and the logical manifold are observed, that is, it is known that the logical manif old increases rather radically as s becomes small. (C) 1999 Elsevier Scienc e Inc. All rights reserved.