Three paraclassical logics combine two negations for classical logic insights

Paraclassical Logics with Two Negations

Logic in Computer Science

Summary

This paper looks at three logical systems that use two types of negation rather than one. The authors study how combining these negations can represent different logical ideas, like tolerating contradictions or gaps in information. They describe how these systems work with special two-valued semantics and show how classical logic can be recreated within these frameworks. They also explore relationships between the different negations and logical consequences in these systems.

What this means in practice

  • For logic tool developers: Implement sound and complete semantics for reasoning systems that handle conflicting or incomplete information using dual negations.
  • For automated reasoning engineers: Design reasoning engines that can recapture classical logic behavior through translations in multi-negation logical systems.

A theory result. No direct application yet.

Authors

Pawel Pawlowski, Pietro Vigiani

Abstract

We study three paraclassical propositional logics with two negations, CLoaN, CLouN, and CLauN, obtained by pairwise combining the one-negation systems CLuN, CLaN, and CLoN. CLuN's negation is glut-tolerant and paraconsistent, CLaN's negationis gap-tolerant and paracomplete, and CLoN's negation is both paraconsistent and paracomplete. We provide sound and complete two-valued non-deterministic semantics for each of the two-negations systems. We then focus on CLauN, the system containing the primitive dual pair of CLaN and CLuN negations. In this setting, we show deductive relationships between different negations expressible in CLauN; we show two diferent ways to recapture classical logic by means of translations, locally and globally; and we show a duality results for the multiple conclusion consequence relation of the logic.