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

Mathematical Logic Quarterly 54 (2):153-166 (2008)
  Copy   BIBTEX


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 [3] but not finitely algebraizable. A characterization of the finitely algebraizable logics defined by LPP-matrices is given.We also make an algebraic study of the equivalent algebraic semantics of the logics associated to the matrices ℳ32,2, ℳ32,1, ℳ31,1, ℳ31,3, and ℳ4 appearing in [11] proving that they are not varieties and finding the free algebra over one generator



    Upload a copy of this work     Papers currently archived: 76,363

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Equivalential and algebraizable logics.Burghard Herrmann - 1996 - Studia Logica 57 (2-3):419 - 436.
Abstract Valuation Semantics.Carlos Caleiro & Ricardo Gonçalves - 2013 - Studia Logica 101 (4):677-712.
Nearly every normal modal logic is paranormal.Joao Marcos - 2005 - Logique Et Analyse 48 (189-192):279-300.
Some multi-conclusion modal paralogics.Casey McGinnis - 2007 - Logica Universalis 1 (2):335-353.
Implicit connectives of algebraizable logics.Xavier Caicedo - 2004 - Studia Logica 78 (1-2):155 - 170.


Added to PP

26 (#449,328)

6 months
1 (#451,398)

Historical graph of downloads
How can I increase my downloads?