Filters and congruences in sectionally pseudocomplemented lattices and posets

Together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that—similar to relatively pseudocomplemented lattices—these structures can serve as an algebraic semantics of certain intuitionistic logics. The aim of the present paper is to define congruences and filters in these structures, derive mutual relationships between them and describe basic properties of congruences in strongly sectionally pseudocomplemented posets. For the description of filters in both sectionally pseudocomplemented lattices and posets, we use the tools introduced by A. Ursini, i.e., ideal terms and the closedness with respect to them. It seems to be of some interest that a similar machinery can be applied also for strongly sectionally pseudocomplemented posets in spite of the fact that the corresponding ideal terms are not everywhere defined.

Sectionally Pseudocomplemented Posets

The concept of a sectionally pseudocomplemented lattice was introduced in Birkhoff (1979) as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular lattice N5. The aim of this paper is to extend the concept of sectional pseudocomplementation from lattices to posets. At first we show that the class of sectionally pseudocomplemented lattices forms a variety of lattices which can be described by two simple identities. This variety has nice congruence properties. We summarize properties of sectionally pseudocomplemented posets and show differences to relative pseudocomplementation. We prove that every sectionally pseudocomplemented poset is completely L-semidistributive. We introduce the concept of congruence on these posets and show when the quotient structure becomes a poset again. Finally, we study the Dedekind-MacNeille completion of sectionally pseudocomplemented posets. We show that contrary to the case of relatively pseudocomplemented posets, this completion need not be sectionally pseudocomplemented but we present the construction of a so-called generalized ordinal sum which enables us to construct the Dedekind-MacNeille completion provided the completions of the summands are known.

Relatively residuated lattices and posets

It is known that every relatively pseudocomplemented lattice is residuated and, moreover, it is distributive. Unfortunately, non-distributive lattices with a unary operation satisfying properties similar to relative pseudocomplementation cannot be converted in residuated ones. The aim of our paper is to introduce a more general concept of a relatively residuated lattice in such a way that also non-modular sectionally pseudocomplemented lattices are included. We derive several properties of relatively residuated lattices which are similar to those known for residuated ones and extend our results to posets.

Galois connection of stabilizers in residuated lattices

The paper is devoted to introduce the notions of some types of stabilizers in non-commutative residuated lattices and to investigate their properties. We establish a connection between (contravariant) Galois connection and stabilizers of a residuated lattices. If A is a residuated lattice and F be a filter of A, we show that the set of all stabilizers relative to F of a same type forms a complete lattice. Furthermore, we prove that ST - F?l, ST - Fl and ST - Fs are pseudocomplemented lattices.

Stone Lattices

Summary The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the other which is dense. The core of the paper is of course the idea of Stone identity $$a^* \sqcup a^{**} = {\rm{T}},$$ which is fundamental for us: Stone lattices are those lattices L, which are distributive, bounded, and satisfy Stone identity for all elements a ∈ L. Stone algebras were introduced by Grätzer and Schmidt in [18]. Of course, the pseudocomplement is unique (if exists), so in a pseudcomplemented lattice we defined a * as the Mizar functor (unary operation mapping every element to its pseudocomplement). In Section 2 we prove formally a collection of ordinary properties of pseudocomplemented lattices. All Boolean lattices are Stone, and a natural example of the lattice which is Stone, but not Boolean, is the lattice of all natural divisors of p 2 for arbitrary prime number p (Section 6). At the end we formalize the notion of the Stone lattice B [2] (of pairs of elements a, b of B such that a ⩽ b) constructed as a sublattice of B 2, where B is arbitrary Boolean algebra (and we describe skeleton and the set of dense elements in such lattices). In a natural way, we deal with Cartesian product of pseudocomplemented lattices. Our formalization was inspired by [17], and is an important step in formalizing Jouni Järvinen Lattice theory for rough sets [19], so it follows rather the latter paper. We deal essentially with Section 4.3, pages 423–426. The description of handling complemented structures in Mizar [6] can be found in [12]. The current article together with [15] establishes the formal background for algebraic structures which are important for [10], [16] by means of mechanisms of merging theories as described in [11].