Citations of:
Add citations
You must login to add citations.


One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non selfextensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of BlokPigozzi. The same negative results hold (...) 

