Paper Info
Title
On the strongest three-valued paraconsistent logic contained in classical logic.
Abstract
LP$^{supset,mathsf{F}}$ is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic. However, it follows easily from already published results that there are exactly 8192 different three-valued paraconsistent propositional logics that have the properties concerned. In this note, properties concerning the logical equivalence relation of a logic are used to distinguish LP$^{supset,mathsf{F}}$ from the others. As one of the bonuses of focussing on the logical equivalence relation, it is found that only 32 of the 8192 logics have a logical equivalence relation that satisfies the identity, annihilation, idempotent, and commutative laws for conjunction and disjunction.
Year
Venue
Field
2017
arXiv: Logic in Computer Science
Logical equivalence,Discrete mathematics,Disjunction introduction,Non-classical logic,Paraconsistent logic,Algorithm,Zeroth-order logic,Many-valued logic,Propositional variable,Intermediate logic,Mathematics
DocType
Volume
Citations 
Journal
abs/1702.03414
0
PageRank 
References 
Authors
0.34
5
1
Name
Order
Citations
PageRank
Cornelis A. Middelburg148749.21