<p>The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\(^+\)</EquationSource> <EquationSource Format="MATHML"><math> <mmultiscripts> <mrow /> <mrow /> <mo>+</mo> </mmultiscripts> </math></EquationSource> </InlineEquation> assigning to each element <i>a</i> the set <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(a^+\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>a</mi> <mo>+</mo> </msup> </math></EquationSource> </InlineEquation> of all its complements is investigated as an operator on the given lattice. We can extend the definition of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(a^+\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>a</mi> <mo>+</mo> </msup> </math></EquationSource> </InlineEquation> in a natural way from elements to arbitrary subsets. In particular we study the set <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(a^+\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>a</mi> <mo>+</mo> </msup> </math></EquationSource> </InlineEquation> for complemented modular lattices, and we characterize when the set <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(a^{++}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>a</mi> <mrow> <mo>+</mo> <mo>+</mo> </mrow> </msup> </math></EquationSource> </InlineEquation> is a singleton. By means of the operator <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\(^+\)</EquationSource> <EquationSource Format="MATHML"><math> <mmultiscripts> <mrow /> <mrow /> <mo>+</mo> </mmultiscripts> </math></EquationSource> </InlineEquation> we introduce two other operators <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq7.gif" Format="GIF" Height="6" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\rightarrow \)</EquationSource> <EquationSource Format="MATHML"><math> <mo stretchy="false">→</mo> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="500_2025_10626_Article_IEq8.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(\odot \)</EquationSource> <EquationSource Format="MATHML"><math> <mo>⊙</mo> </math></EquationSource> </InlineEquation> which can be considered as implication and conjunction in a certain propositional calculus, respectively. These two logical connectives are “unsharp” which means that they assign to each pair of elements a non-empty subset. However, also these two derived operators share a lot of properties with the corresponding logical connectives in intuitionistic logic or in the logic of quantum mechanics. In particular, they form an adjoint pair. Finally, we define so-called deductive systems and we show their relationship to the mentioned operators as well as to lattice filters.</p>

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

Operators on complemented lattices

  • Ivan Chajda,
  • Helmut Länger

摘要

The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping \(^+\) + assigning to each element a the set \(a^+\) a + of all its complements is investigated as an operator on the given lattice. We can extend the definition of \(a^+\) a + in a natural way from elements to arbitrary subsets. In particular we study the set \(a^+\) a + for complemented modular lattices, and we characterize when the set \(a^{++}\) a + + is a singleton. By means of the operator \(^+\) + we introduce two other operators \(\rightarrow \) and \(\odot \) which can be considered as implication and conjunction in a certain propositional calculus, respectively. These two logical connectives are “unsharp” which means that they assign to each pair of elements a non-empty subset. However, also these two derived operators share a lot of properties with the corresponding logical connectives in intuitionistic logic or in the logic of quantum mechanics. In particular, they form an adjoint pair. Finally, we define so-called deductive systems and we show their relationship to the mentioned operators as well as to lattice filters.