Abstract

An l-hemi-implicative semilattice is an algebra $$\mathbf {A} = $$ A= such that $$$$ is a semilattice with a greatest element 1 and satisfies: for every $$a,b,c\in A$$ a,b,c∈A, $$a\le b\rightarrow c$$ a≤b→c implies $$a\wedge b \le c$$ a∧b≤c and $$a\rightarrow a = 1$$ a→a=1. An l-hemi-implicative semilattice is commutative if if it satisfies that $$a\rightarrow b = b\rightarrow a$$ a→b=b→a for every $$a,b\in A$$ a,b∈A. It is shown that the class of l-hemi-implicative semilattices is a variety. These algebras provide a general framework for the study of different algebras of interest in algebraic logic. In any l-hemi-implicative semilattice it is possible to define an derived operation by $$a \sim b := \wedge $$ a∼b:=∧. Endowing $$$$ with the binary operation $$\sim $$ ∼ the algebra $$$$ results an l-hemi-implicative semilattice, which also satisfies the identity $$a \sim b = b \sim a$$ a∼b=b∼a. In this article, we characterize the commutative l-hemi-implicative semilattices. We also provide many new examples of l-hemi-implicative semilattice on any semillatice with greatest element. Finally, we characterize congruences on the classes of l-hemi-implicative semilattices introduced earlier and we characterize the principal congruences of l-hemi-implicative semilattices.