Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421656 | Electronic Notes in Theoretical Computer Science | 2015 | 14 Pages |
Abstract
We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show that C1 can be extended to larger paraconsistent logics by adding some desirable properties as axioms. We use three-valued logics to support our claims.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics