Abstract :
Upper and lower bounds are derived for the number of pseudothreshold functions of n variables. (Pseudothershold logic is a generalization of threshold logic.) It is shown that a lower bound on the number of pseudothreshold functions P(n) of exactly n variables realized by zero-free structures is The number of pseudothreshold functions Q(n) of n variables realized by nontrivial structures is bounded by It is also proven that is a lower bound on the number of positive functions of exactly n variables.
Keywords :
Bounds, positive functions, pseudothreshold functions, separable functions, threshold functions, threshold logic.; Boolean functions; Computer science; Logic; Telephony; Bounds, positive functions, pseudothreshold functions, separable functions, threshold functions, threshold logic.;
