Non-covering in the interpretability lattice of equational theories
✍ Scribed by Ralph McKenzie; Stanislaw Świerczkowski
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 664 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Q-distributive lattice is an algebra (L, v, A, V, 0, 1 ) of type (2, 2, 1, 0, 0) such that (L, V, A, 0, 1 ) is a bounded distributive lattice and 27 satisfies the equations V0 = 0, x A Vx = x, V(x V y) = Vx V Vy and V(x A Vy) = Vx A 27y. The aim of this paper is to find, for each proper subvariety
Most of the work on the combination of unification algorithms for the union of disjoint equational theories has been restricted to algorithms that compute finite complete sets of unifiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms