On the algebraizability of annotated logics
From MaRDI portal
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).
Recommendations
Cited in
(12)- Update to ``A survey of abstract algebraic logic
- Algebras and matrices for annotated logics
- Annotated logics Q and ultraproducts
- scientific article; zbMATH DE number 1696719 (Why is no real title available?)
- An annotated logic defined by a matrix
- Algebraization of Non-structural Logics
- scientific article; zbMATH DE number 1302500 (Why is no real title available?)
- scientific article; zbMATH DE number 2019878 (Why is no real title available?)
- XI Latin American Symposium on Mathematical Logic
- On recent applications of paraconsistent logic: an exploratory literature review
- On free annotated algebras
- The Paraconsistent Logics PJ
This page was built for publication: On the algebraizability of annotated logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378429)