Algebraic study of Sette's maximal paraconsistent logic (Q1344874): Difference between revisions

The paper presents a lot of algebraic results concerning abstract Sette logics, but first of all the paraconsistent deductive system \(\text{P}^ 1\). Section 2 specifies the algebraic notations used throughout the paper and presents a condensed introduction to Algebraic Logic. In Section 3 the concept of an abstract Sette logic together with its basic properties is introduced: abstract Sette logics are analogues of the deductive system \(\text{P}^ 1\) in the same way as the abstract classical logics are analogues of the classical deductive system PC. Further results concern the relationship between PC, the variety of all Boolean algebras and the class of all abstract classical logics. The author hopes that such a manner of using abstract logic in studying algebraizable deductive systems opens a gateway between the logistic and the model-theoretic traditions in Algebraic Logic. Section 4 studies algebraic semantics for \(\text{P}^ 1\). It turns out that although \(\text{P}^ 1\) fails to be algebraically characterized within such general approaches as Czelakowski's and Rasiowa's, it is algebraizable in the sense of Blok and Pigozzi. Section 5 deals with a finitely axiomatized variety of quasi-Sette algebras. Its filters are studied in Section 7. In Section 6 it is shown by algebraic means only that the system PC is the only proper nontrivial extension of \(\text{P}^ 1\). Section 8 provides an algebraic characterization of abstract Sette logics and discusses the question of the maximality of paraconsistency of \(\text{P}^ 1\). Finally, Section 9 obtains completeness results for the deductive systems PC and \(\text{P}^ 1\).