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

The author considers switching networks in a special \((p,q)\)-logic with \(p\)-valued output \((p\geq q)\), using threshold elements and connecting their realization with analog-like min-max circuits. In this way a notion of \(s\)-completeness is developed for some parameter \(s\) \((s\leq q-1)\) and some further conditions are discussed.