English

Balanced residuated partially ordered semigroups

Logic in Computer Science 2025-05-20 v1

Abstract

A residuated semigroup is a structure A,,,\,/\langle A,\le,\cdot,\backslash,/ \rangle where A,\langle A,\le \rangle is a poset and A,\langle A,\cdot \rangle is a semigroup such that the residuation law xyz    xz/y    yx\zx\cdot y\le z\iff x\le z/y\iff y\le x \backslash z holds. An element pp is positive if apaa\le pa and aapa \le ap for all aa. A residuated semigroup is called balanced if it satisfies the equation x\xx/xx \backslash x \approx x / x and moreover each element of the form a\a=a/aa \backslash a = a / a is positive, and it is called integrally closed if it satisfies the same equation and moreover each element of this form is a global identity. We show how a wide class of balanced residuated semigroups (so-called steady residuated semigroups) can be decomposed into integrally closed pieces, using a generalization of the classical Plonka sum construction. This generalization involves gluing a disjoint family of ordered algebras together using multiple families of maps, rather than a single family as in ordinary Plonka sums.

Cite

@article{arxiv.2505.12024,
  title  = {Balanced residuated partially ordered semigroups},
  author = {Stefano Bonzio and José Gil-Férez and Peter Jipsen and Adam Přenosil and Melissa Sugimoto},
  journal= {arXiv preprint arXiv:2505.12024},
  year   = {2025}
}
R2 v1 2026-07-01T02:18:37.821Z