In this paper, we establish necessary and sufficient representation theorems for the classes , , , and of uninorms on bounded trellises, extending the corresponding bounded-lattice results. For a non-extremal neutral element belonging to no non-trivial cycle, we use a common decomposition of the elements incomparable with ; every neutral element of a uninorm is shown to be middle-transitive. Each uninorm in (respectively, ) is represented by an interior operator (respectively, a closure operator), a component uninorm, and an increasing, associative, and commutative operation, with all components uniquely determined. Two further conditions characterize the subclasses and . For (respectively, ), we identify the pairs in whose values lie in (respectively, ) or equal . The pairs producing satisfy a symmetric unique-partner condition, while the remaining values are encoded by a partial operation. Regional order compatibility and explicit associativity conditions then yield necessary and sufficient representations. Finally, we compare the four classes, relate them to the corresponding bounded-psoset classes, prove their bounded-lattice specialization under transitivity, and provide finite examples on proper trellises illustrating the additional compatibility conditions.

生成讲解博客的中文版本

生成AI智能校验的中文版本