A characterization of congruence kernels in pseudocomplemented semilattices
We introduce the so-called DN-algebra whose axiomatic system is a common axiomatization of directoids with an antitone involution and the so-called D-quasiring. It generalizes the concept of Newman algebras (introduced by H. Dobbertin) for a common axiomatization of Boolean algebras and Boolean rings.
By a nearlattice is meant a join-semilattice where every principal filter is a lattice with respect to the induced order. The aim of our paper is to show for which nearlattice and its element the mapping is a (surjective, injective) homomorphism of into .
The concept of a deductive system has been intensively studied in algebraic logic, per se and in connection with various types of filters. In this paper we introduce an axiomatization which shows how several resembling theorems that had been separately proved for various algebras of logic can be given unique proofs within this axiomatic framework. We thus recapture theorems already known in the literature, as well as new ones. As a by-product we introduce the class of pre-BCK algebras.
Characterizations for a pseudocomplemented modular join-semilattice with 0 and 1 and its ideal lattice to be a Stone lattice are given.
Let be a Hilbert algebra. The monoid of all unary operations on generated by operations , which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of . This semilattice is isomorphic to the semilattice of finitely generated filters of , it is subtractive (i.e., dually implicative), and its ideal lattice is isomorphic to the filter lattice of . Moreover, the order dual of the adjoint semilattice is a minimal Brouwerian extension of , and the...