Metraipolis › archive › dc_fb84ec738af0
A complete representation theorem for nullnorms on bounded trellises — arXiv:2609.14509
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14509
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:38:26.931Z
- SHA-256 of the archived text
ff5d750f5692b5cd104915ce02c897f6add671176190e24d2082e1ad25d68a8b- Stable URL of this page
https://metraipolis.com/documento/dc_fb84ec738af0
How to cite
A complete representation theorem for nullnorms on bounded trellises — arXiv:2609.14509 — arXiv (en), https://arxiv.org/abs/2609.14509 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb84ec738af0 (Metraipolis archive dc_fb84ec738af0, sha256 ff5d750f5692b5cd104915ce02c897f6add671176190e24d2082e1ad25d68a8b)
BibTeX
@misc{dcfb84ec738af0,
title = {A complete representation theorem for nullnorms on bounded trellises — arXiv:2609.14509},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14509},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb84ec738af0; sha256 ff5d750f5692b5cd104915ce02c897f6add671176190e24d2082e1ad25d68a8b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14509. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $I_a^3\times I_a^3$, where $I_a^3$ consists of the elements incomparable with the absorbing element $a$ that neither reach $a$ nor are reachable from $a$. 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 $I_a^3$. 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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.LO). Categorie arXiv: Logic (math.LO). Pagina del lavoro: https://arxiv.org/abs/2609.14509 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T01:22:41.481Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).