Idempotent Full Paraconsistent Negations are not Algebraizable

Abstract

1 What are the features of a paraconsistent negation? Since paraconsistent logic was launched by da Costa in his seminal paper [4], one of the fundamental problems has been to determine what exactly are the theoretical or metatheoretical properties of classical negation that can have a unary operator not obeying the principle of noncontradiction, that is, a paraconsistent operator. What the result presented here shows is that some of these properties are not compatible with each other, so that in constructing a paraconsistent negation as close as possible to classical negation, we have to make a choice among classical properties compatible with the idea of paraconsistency. In particular, there is no paraconsistent negation more classical than all the others.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-12-22

Downloads
95 (#554,604)

6 months
14 (#859,264)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A Calculus for Antinomies.F. G. Asenjo - 1966 - Notre Dame Journal of Formal Logic 16 (1):103-105.
Every quotient algebra for $C_1$ is trivial.Chris Mortensen - 1980 - Notre Dame Journal of Formal Logic 21 (4):694-700.
Paraconsistency and the $\rm C$-systems of da Costa.Igor Urbas - 1989 - Notre Dame Journal of Formal Logic 30 (4):583-597.
Paraconsistency and C1.Chris Mortensen - 1989 - In Graham Priest, Richard Routley & Jean Norman, Paraconsistent Logic: Essays on the Inconsistent. Philosophia Verlag. pp. 289--305.

Add more references