On the algebraizability of annotated logics (Q1378429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the algebraizability of annotated logics |
scientific article; zbMATH DE number 1117769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algebraizability of annotated logics |
scientific article; zbMATH DE number 1117769 |
Statements
On the algebraizability of annotated logics (English)
0 references
11 October 1998
0 references
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).
0 references
annotated logic
0 references
structural logic
0 references
algebraizable logic
0 references
congruential system
0 references
