为了更好地描述信息的聚合,有限链上的左(右)nullnorm的概念被引入。然后,各种光滑的左(右)nullnorm的结构定理被给出,即给出了一个二元运算是光滑的左(右)nullnorm的充要条件。
In order to describe the aggregation of information better, the concepts of left (right) nullnoms on the finite chain are introduced. Then the structural theorems for all kinds of smoothly left (right) ones are established, that is, the necessary and sufficient conditions, under which a binary operator is a smoothly left (right) nullnorm, are given.