Independence of the equational axioms for iteration theories
✍ Scribed by Z. Ésik
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 619 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we describe the covering relation in the lattice of the equational theories of commutative semigroups. We use the description and the methods worked out in an earlier paper by the second author [1994, Trans. Amer. Math. Soc. 342, 275-306].
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
## Abstract We show that the both assertions “in every vector space __B__ over a finite element field every subspace __V__ ⊆ __B__ has a complementary subspace __S__” and “for every family 𝒜 of disjoint odd sized sets there exists a subfamily ℱ={F~j~:j ϵω} with a choice function” together imply the