Paraconsistent Logic: A Proof-Theoretical Approach

Teorema: International Journal of Philosophy 25 (2):5-24 (2006)
  Copy   BIBTEX

Abstract

A logic is paraconsistent if it allows for non-trivial inconsistent theories. Given the usual definition of inconsistency, the notion of paraconsistent logic seems to rely upon the interpretation of teh sign '¬'. As paraconsistent logic challenges properties of negation taken to be basic in other contexts, it is disputable that an operator lacking those properties will count as real negation. The conclusion is that there cannot be genuine paraconsistent logics. This objection can be met from a substructural perspective, since paraconsistent sequent calculi can be built from the same operational rules as classical logic but with slightly different structural rules.

Author's Profile

Analytics

Added to PP
2013-10-31

Downloads
64 (#100,296)

6 months
56 (#88,543)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?