Sectionally pseudocomplemented posets (Q2665835)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7430974
Language Label Description Also known as
default for all languages
No label defined
    English
    Sectionally pseudocomplemented posets
    scientific article; zbMATH DE number 7430974

      Statements

      Sectionally pseudocomplemented posets (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      19 November 2021
      0 references
      \par A lattice \(L=(L,\vee,\wedge)\) is said to be \textit{sectionally pseudocomplemented} provided that for every \(a,b\in L\), there exists the pseudocomplement of \(a\vee b\) with respect to \(b\) in the interval \([b)=\{x\in L\,|\,b\leqslant x\}\), i.e., there exists the greatest element \(c\in L\) satisfying \((a\vee b)\wedge c=b\). This element \(c\) is called the \textit{sectional pseudocomplement of \(a\) with respect to \(b\)} and is denoted \(a\ast b\) [the first author, Acta Sci. Math. 69, No. 3--4, 491--496 (2003; Zbl 1048.06005)]. The present paper introduces the concept of sectionally pseudocomplemented partially ordered set (poset) as follows. \par Given a poset \(P=(P,\leqslant)\) and a subset \(A\subseteq P\), one defines \(L(A)=\{x\in P\mid x\leqslant a\) for every \(a\in A\}\) and \(U(A)=\{x\in P\mid a\leqslant x\) for every \(a\in A\}\). Then \(P\) is called \textit{sectionally pseudocomplemented} provided that for every \(a,b\in P\), there exists the greatest element \(c\in P\) such that \(L(U(\{a,b\})\bigcup\{c\}) = L(\{b\})\). This element \(c\) is called the \textit{sectional pseudocomplement \(a\ast b\) of \(a\) with respect to \(b\)}. \par The authors study properties of sectionally pseudocomplemented posets, e.g., compare them with relatively pseudocomplemented posets of [the first author et al., Math. Slovaca 70, No. 2, 239--250 (2020; Zbl 1505.06005)], consider their congruences, and construct the respective Dedekind-MacNeille completion, stating some sufficient conditions under which the Dedekind-MacNeille completion of a sectionally pseudocomplemented poset is sectionally pseudocomplemented. The paper also shows that the class of sectionally pseudocomplemented lattices forms a variety, which (besides the lattice axioms) is determined by two simple identities. \par The paper is well written, provides most of its required preliminaries (the omitted concepts can be found in one of the references at the end of the paper), and will be of interest to the researchers studying ordered algebraic structures.
      0 references
      CKL-sectionally pseudocomplemented poset
      0 references
      completely \(L\)-semidistributive poset
      0 references
      completely meet-semidistributive lattice
      0 references
      convex congruence
      0 references
      join-semilattice
      0 references
      Dedekind-MacNeille completion
      0 references
      distributive lattice
      0 references
      relative pseudocomplemented lattice
      0 references
      sectionally pseudocomplemented lattice
      0 references
      sectionally pseudocomplemented poset
      0 references
      variety of lattices
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references