Literal‐paraconsistent and literal‐paracomplete matrices

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. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)