Expanding FLew with a Boolean connective

We expand FLew with a unary connective whose algebraic counterpart is the operation that gives the greatest complemented element below a given argument. We prove that the expanded logic is conservative and has the Finite Model Property. We also prove that the corresponding expansion of the class of residuated lattices is an equational class.Comment: 15 pages, 4 figures in Soft Computing, published online 23 July 201

Elementos de lógica

Fil: Ertola Biraben, Rodolfo C.. Universidad Nacional de La Plata. Facultad de Humanidades y Ciencias de la Educación; Argentina

On an operation with regular elements

In this paper, we prove that the class of meet-complemented lattices expanded with the greatest regular below, which is right adjoint to the double meet-complement, is an equational class satisfying the Stone equality. It is also the case that the class of distributive meet-complemented lattices with the greatest regular below is the same as the class of Stone distributive meet-complemented lattices with the greatest Boolean below2372271227