<p>A construction is described which, when applicable, associates with a sectionally pseudocomplemented poset <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="MediaObjects/40879_2025_883_IEq1_HTML.gif" Format="GIF" Height="24" Rendition="HTML" Resolution="120" Type="Linedraw" Width="85" /> </InlineMediaObject> </InlineEquation> a certain operation <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\rightarrow \)</EquationSource> <EquationSource Format="MATHML"><math> <mo stretchy="false">→</mo> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(x \rightarrow y = x'_y\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo stretchy="false">→</mo> <mi>y</mi> <mo>=</mo> <msubsup> <mi>x</mi> <mi>y</mi> <mo>′</mo> </msubsup> </mrow> </math></EquationSource> </InlineEquation> whenever <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(y \leqslant x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>y</mi> <mo>⩽</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation>. If <i>A</i> is an upper semilattice, then <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(x \rightarrow y = (x \hspace{1.111pt}{\vee }\hspace{1.111pt}y)'_y\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo stretchy="false">→</mo> <mi>y</mi> <mo>=</mo> <msubsup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mspace width="1.111pt" /> <mo>∨</mo> <mspace width="1.111pt" /> <mi>y</mi> <mo stretchy="false">)</mo> </mrow> <mi>y</mi> <mo>′</mo> </msubsup> </mrow> </math></EquationSource> </InlineEquation> for all <i>x</i>,&#xa0;<i>y</i>. The resulting ordered algebras <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\((A,\rightarrow ,1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mo>,</mo> <mo stretchy="false">→</mo> <mo>,</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> (recently already considered by the author under the name ‘normal ESP-posets’) are characterized axiomatically: they are particular dual weak BCK-algebras termed pseudoimplicative. In the case when the meet exists in <i>A</i> for every pair of elements bounded below, a normal ESP-poset is a dual BCK-algebra (necessarily pseudoimplicative) if and only if it has distributive upper sections. Moreover, these sections are then Brouwerian semilattices.</p>

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

From sectionally pseudocomplemented posets to pseudoimplicative dual BCK-algebras

  • Jānis Cīrulis

摘要

A construction is described which, when applicable, associates with a sectionally pseudocomplemented poset a certain operation \(\rightarrow \) such that \(x \rightarrow y = x'_y\) x y = x y whenever \(y \leqslant x\) y x . If A is an upper semilattice, then \(x \rightarrow y = (x \hspace{1.111pt}{\vee }\hspace{1.111pt}y)'_y\) x y = ( x y ) y for all xy. The resulting ordered algebras \((A,\rightarrow ,1)\) ( A , , 1 ) (recently already considered by the author under the name ‘normal ESP-posets’) are characterized axiomatically: they are particular dual weak BCK-algebras termed pseudoimplicative. In the case when the meet exists in A for every pair of elements bounded below, a normal ESP-poset is a dual BCK-algebra (necessarily pseudoimplicative) if and only if it has distributive upper sections. Moreover, these sections are then Brouwerian semilattices.