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.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-10-31

Downloads
321 (#138,979)

6 months
113 (#115,338)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Philosophy of logic.Willard Van Orman Quine - 1970 - Englewood Cliffs, N.J.,: Prentice-Hall.
Theory of Logical Calculi: Basic Theory of Consequence Operations.Ryszard Wójcicki - 1988 - Dordrecht, Boston and London: Kluwer Academic Publishers.
Foundations of mathematical logic.Haskell Brooks Curry - 1963 - New York: Dover Publications.
Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.

View all 16 references / Add more references