Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP (which is built in the $$ \{\vee ,\wedge ,\lnot \} $$ -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the paracomplete analogue of LP, strong Kleene logic $$ \mathbf K_3 $$ . In this paper, we generalize these results for the negative fragments of LP and $$ \mathbf K_3 $$ , respectively. Thus, the method of correspondence analysis works for the logics which have the same negations as LP or $$ \mathbf K_3 $$ , but either have different conjunctions or disjunctions or even don’t have them as well at all. Besides, we show that correspondence analyses for the negative fragments of $$ \mathbf K_3 $$ and LP, respectively, are also suitable without any changes for the negative fragments of Heyting’s logic $$ \mathbf G_3 $$ and its dual $$ \mathbf DG_3 $$ (which have different interpretations of negation than $$ \mathbf K_3 $$ and LP).
Read full abstract