paper

A complete representation theorem for nullnorms on bounded trellises

arXiv:2609.14509

Abstract

We establish necessary and sufficient conditions under which a binary operation on a bounded trellis is a proper nullnorm. The representation combines a t-conorm on the lower interval, a t-norm on the upper interval, two order-preserving maps, and a commutative, increasing function on , where consists of the elements incomparable with the absorbing element that neither reach nor are reachable from . Unlike earlier range-restricted constructions, this function may take values anywhere in the trellis. To preserve associativity for such unrestricted values, we introduce a mixed interaction function that evaluates every pair with at least one component in . We also derive the specializations in which this region is empty or consists of a single element, including an exact description of the admissible value in the singleton case. A five-element lattice example shows that the mixed associativity condition is independent of the remaining hypotheses, while a fourteen-element nontransitive trellis example demonstrates the necessity of allowing the unrestricted range. Finally, the principal range-restricted subclasses and the bounded-lattice case are recovered as specializations of the general representation.

A complete representation theorem for nullnorms on bounded trellises · wovepaper