Maximally Paraconsistent Three-Valued Logics

Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We first show that most of the logics that are based on properly non-deterministic three-valued matrices are not maximally paraconsistent. Then we show that in contrast, in the deterministic case all the natural three-valued paraconsistent logics are maximal. This includes well-known threevalued paraconsistent logics like P1, LP, J3, PAC and SRM3, as well as any extension of them obtained by enriching their languages with extra three-valued connectives.

• Type: Conference
• Year: 2010
• Where: KR
• Authors: Ofer Arieli, Arnon Avron, Anna Zamansky
• Keywords: Automated Reasoning, KR 2010, Logics, Non-deterministic Three-valued Matrices, Paraconsistent Logics