On the algebraizability of annotated logics (Q1378429)

The authors introduce a structural version of annotated logics (introduced by V. S. Subrahmanian as logic foundation of computer programming) and prove that they are equivalent to the original systems, in the sense that everything provable in a system of one type has a translation that is provable in the corresponding system of the other types. The main result is that annotated logics are weakly congruental. The authors also characterize the class of all annotated logics that are algebraizable (in terms of Blok and Pigozzi).