We introduce a deductive system Bal which models the logic of balance of opposing forces or of balance between conflicting evidence or influences. “Truth values” are interpreted as deviations From a… (More)

Annotated logics were introduced by V. S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not… (More)

We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their… (More)

We study the matrices, reduced matrices and algebras associated to the systems SALτ of structural annotated logics. In previous papers, these systems were proven algebraizable in the finitary case… (More)

In [3] the authors proved that the deductive system P1 introduced by Sette in [6] is algebraizable. In this paper we study the main features of the class of algebras thus obtained. The main results… (More)

Given a finite set A and a distinguished function f : A −→ A , we study the set of all functions g : A −→ A that are continuous for all topologies for which f is continuous. The main result is a… (More)

We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenbergin[11] proving that theyare all algebraizable in… (More)