Abstract
The classical method of associating a class of algebras with a logical system is that of Lindenbaum and Tarski. It can be applied to any system with a biconditional ↔ that is compositional in the sense that it defines a congruence relation on the absolutely free algebra of formulas. The method has been abstacted to provide effiective criteria for the algebraizability of a large class of formal systems. One consequence of this work is a uniform method of providing a formal system with algebraic semantics. The main features of the theory of abstract algebraic logic and one of its potential applications are surveyed.
Cite
CITATION STYLE
Pigozzi, D. (1998). Abstract algebraic logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1548, pp. 8–16). Springer Verlag. https://doi.org/10.1007/3-540-49253-4_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
