Intersection of finitely generated congruences over term algebra
✍ Scribed by Sándor Vágvölgyi
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 350 KB
- Volume
- 300
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that
If the answer is yes, then we can e ectively construct such a ground term rewrite system U . In other words, for any given ÿnitely generated congruences and over the term algebra, it is decidable if ∩ is a ÿnitely generated congruence. If the answer is yes, then we can e ectively construct a ground term rewrite system U such that ↔ * U = ∩ .
📜 SIMILAR VOLUMES
We investigate certain pure injective modules over generalised Weyl algebras. We consider pure injective hulls of finite length modules, the elementary duals of these, torsionfree pure injective modules, and the closure in the Ziegler spectrum of the category of finite length modules supported on a