Subresiduated lattice ordered commutative monoids
Cornejo J.M., San Mart\'in H.J., S\'igal V

TL;DR
This paper introduces subresiduated lattice ordered commutative monoids, proves they form a variety, and explores their algebraic structure and congruence lattices, extending previous algebraic frameworks.
Contribution
It establishes that srl-monoids form a variety and characterizes their congruence lattices and subalgebras, generalizing subresiduated and residuated lattices.
Findings
The class of srl-monoids forms a variety.
Congruence lattices are isomorphic to strongly convex subalgebras.
Provides an alternative equational basis for the variety.
Abstract
A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a pair where is an algebra of type such that is a lattice, is a commutative monoid, for every and is a subalgebra of \textbf{A} such that for each there exists with the property that for all , if and only if . This is denoted by , or simply by . The srl-monoids can be regarded as algebras of type . These algebras are a generalization of subresiduated lattices and commutative residuated lattices respectively. In this paper we prove that the class of srl-monoids forms a variety. We show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rings, Modules, and Algebras
