Sciweavers

265 search results - page 1 / 53
» Weakly Algebraizable Logics
Sort
View
JSYML
2000
97views more  JSYML 2000»
13 years 5 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 discarde...
Janusz Czelakowski, Ramon Jansana
ACS
2002
13 years 5 months ago
Categorical Abstract Algebraic Logic: Algebraizable Institutions
cal Abstract Algebraic Logic: Algebraizable Institutions To Don Pigozzi this work is dedicated GEORGE VOUTSADAKIS Department of Mathematics, Iowa State University, Ames, IA 50011 U...
George Voutsadakis
MLQ
2002
77views more  MLQ 2002»
13 years 5 months ago
Algebraization of the Three-valued BCK-logic
In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivale...
Francisco M. García Olmedo, Antonio J. Rodr...
IGPL
2007
75views more  IGPL 2007»
13 years 5 months ago
Fibring in the Leibniz Hierarchy
This article studies preservation of certain algebraic properties of propositional logics when combined by fibring. The logics analyzed here are classified in protoalgebraic, eq...
Víctor L. Fernández, Marcelo E. Coni...
NDJFL
1998
105views more  NDJFL 1998»
13 years 5 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
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 ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau