Algebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices

Abstract

We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenberg in [11], proving that they are all algebraizable in the sense of Blok and Pigozzi in [31 but not finitely algebraizable. A characterization of the finitely algebraizable logics defined by LPP-matrices is given.