Congruences in ordered sets
A concept of congruence preserving upper and lower bounds in a poset is introduced. If is a lattice, this concept coincides with the notion of lattice congruence.
A concept of congruence preserving upper and lower bounds in a poset is introduced. If is a lattice, this concept coincides with the notion of lattice congruence.
A concept of equivalence preserving upper and lower bounds in a poset is introduced. If is a lattice, this concept coincides with the notion of lattice congruence.
It is known that congruence lattices of pseudocomplemented semilattices are pseudocomplemented [4]. Many interesting properties of congruences on pseudocomplemented semilattices were described by Sankappanavar in [4], [5], [6]. Except for other results he described congruence distributive pseudocomplemented semilattices [6] and he characterized pseudocomplemented semilattices whose congruence lattices are Stone, i.e. belong to the variety B₁ [5]. In this paper we give a partial solution to a more...
We deal with congruences on semilattices with section antitone involution which rise e.g., as implication reducts of Boolean algebras, MV-algebras or basic algebras and which are included among implication algebras, orthoimplication algebras etc. We characterize congruences by their kernels which coincide with semilattice filters satisfying certain natural conditions. We prove that these algebras are congruence distributive and 3-permutable.
We generalize the correspondence between basic algebras and lattices with section antitone involutions to a more general case where no lattice properties are assumed. These algebras are called conjugated if this correspondence is one-to-one. We get conditions for the conjugary of such algebras and introduce the induced relation. Necessary and sufficient conditions are given to indicated when the induced relation is a quasiorder which has “nice properties", e.g. the unary operations are antitone...