Browsing by Author "Lewin, Renato A."

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Algebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices
    (WILEY-V C H VERLAG GMBH, 2008) Hirsh, Eduardo; Lewin, Renato A.
    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.
  • No Thumbnail Available
    Item
    Literal-paraconsistent and literal-paracomplete matrices
    (2006) Lewin, Renato A.; Mikenberg, Irene F.
    We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail several relevant examples. (c) 2006 WILEY-VCH Verlag GmbH & Co. KGaA. Weinheim.