<p>A subresiduated lattice ordered commutative monoid (srl-monoid for short) is a pair <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="49" /> </InlineMediaObject> <EquationSource Format="TEX">\(({\textbf {A}},Q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="bold">A</mi> <mo>,</mo> <mi>Q</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="128" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textbf {A}}=(A,\wedge ,\vee ,\cdot ,e)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">A</mi> <mo>=</mo> <mo stretchy="false">(</mo> <mi>A</mi> <mo>,</mo> <mo>∧</mo> <mo>,</mo> <mo>∨</mo> <mo>,</mo> <mo>·</mo> <mo>,</mo> <mi>e</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is a lattice ordered monoid and <i>Q</i> is a subalgebra of <b>A</b> such that for each <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq3.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="62" /> </InlineMediaObject> <EquationSource Format="TEX">\(a,b\in A\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>,</mo> <mi>b</mi> <mo>∈</mo> <mi>A</mi> </mrow> </math></EquationSource> </InlineEquation> the set <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="139" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{q \in Q: a \cdot q \le b\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mi>q</mi> <mo>∈</mo> <mi>Q</mi> <mo>:</mo> <mi>a</mi> <mo>·</mo> <mi>q</mi> <mo>≤</mo> <mi>b</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> has maximum, which will be denoted by <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(a\rightarrow b\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo stretchy="false">→</mo> <mi>b</mi> </mrow> </math></EquationSource> </InlineEquation>. The srl-monoids can be regarded as algebras <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10594_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="117" /> </InlineMediaObject> <EquationSource Format="TEX">\((A,\wedge ,\vee ,\cdot ,\rightarrow ,e)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mo>,</mo> <mo>∧</mo> <mo>,</mo> <mo>∨</mo> <mo>,</mo> <mo>·</mo> <mo>,</mo> <mo stretchy="false">→</mo> <mo>,</mo> <mi>e</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of type (2,&#xa0;2,&#xa0;2,&#xa0;2,&#xa0;0). This class of algebras is a variety which properly contains the varieties of commutative residuated lattices and subresiduated lattices respectively. In this paper, we study some aspects of the lattice of congruences of any srl-monoid, which is order isomorphic to the lattice of its strongly convex subalgebras. As application of this study we characterize simple and subdirectly irreducible algebras, we prove that every srl-monoid has the congruence extension property and we describe compatible functions. Then we focus our attention on a family of compatible functions, which will be called monotone modal operators, and considering as monotone modal operator the identity map, we introduce and study the variety of strong srl-monoids and some of its subvarieties.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On subresiduated lattice ordered commutative monoids and some of its subvarieties

  • Juan Manuel Cornejo,
  • Hernán Javier San Martín,
  • Valeria Anahí Sígal

摘要

A subresiduated lattice ordered commutative monoid (srl-monoid for short) is a pair \(({\textbf {A}},Q)\) ( A , Q ) where \({\textbf {A}}=(A,\wedge ,\vee ,\cdot ,e)\) A = ( A , , , · , e ) is a lattice ordered monoid and Q is a subalgebra of A such that for each \(a,b\in A\) a , b A the set \(\{q \in Q: a \cdot q \le b\}\) { q Q : a · q b } has maximum, which will be denoted by \(a\rightarrow b\) a b . The srl-monoids can be regarded as algebras \((A,\wedge ,\vee ,\cdot ,\rightarrow ,e)\) ( A , , , · , , e ) of type (2, 2, 2, 2, 0). This class of algebras is a variety which properly contains the varieties of commutative residuated lattices and subresiduated lattices respectively. In this paper, we study some aspects of the lattice of congruences of any srl-monoid, which is order isomorphic to the lattice of its strongly convex subalgebras. As application of this study we characterize simple and subdirectly irreducible algebras, we prove that every srl-monoid has the congruence extension property and we describe compatible functions. Then we focus our attention on a family of compatible functions, which will be called monotone modal operators, and considering as monotone modal operator the identity map, we introduce and study the variety of strong srl-monoids and some of its subvarieties.