Idempotent Full Paraconsistent Negations are not Algebraizable

Notre Dame Journal of Formal Logic 39 (1):135-139 (1998)
  Copy   BIBTEX

Abstract

Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that $\neg(a\wedge\neg a)$ is a theorem which can be algebraized by a technique similar to the Tarski-Lindenbaum technique.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

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

Through your library

Analytics

Added to PP
2010-08-24

Downloads
71 (#232,034)

6 months
18 (#143,247)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jean-Yves Beziau
Federal University of Rio de Janeiro

References found in this work

Logic of Paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219-241.
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.
Aspects of Paraconsistent Logic.Newton A. da Costa, Jean-Yves Beziau & Otavio S. Bueno - 1995 - Logic Journal of the IGPL 3 (4):597-614.

View all 8 references / Add more references