Sciweavers

JSYML
2000

Weakly Algebraizable Logics

13 years 11 months ago
Weakly Algebraizable Logics
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarded on this definition, by presenting an example of a system with injective and non monotonic Leibniz operator. We also show that the non injectivity of the non protoalgebraic inf-sup fragment of the Classic Propositional Calculus, CPC, holds only from the fact that the empty set is a CPC-filter.
Janusz Czelakowski, Ramon Jansana
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where JSYML
Authors Janusz Czelakowski, Ramon Jansana
Comments (0)