The Equational Logic For Graph Algebras
✍ Scribed by Reinhard Pöschel
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 598 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this article the classification of finite flat graph algebras which have finite equational bases is given in terms of omitted induced subgraphs. The result is related to an earlier result obtained for finite graph algebras by Baker, McNulty, and Werner.
## Abstract Equivalent deductive systems were introduced in [4] with the goal of treating 1‐deductive systems and algebraic 2‐deductive systems in a uniform way. Results of [3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if
## Abstract In this paper we address our efforts to extend the well‐known connection in equational logic between equational theories and fully invariant congruences to other–possibly infinitary–logics. In the special case of algebras, this problem has been formerly treated by H. J. Hoehnke [10] and