The complexity of the word problem for abelian l-groups
- 31 December 1986
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 48 (1) , 127-132
- https://doi.org/10.1016/0304-3975(86)90089-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A simple proof of the hereditary undecidability of the theory of lattice-ordered abelian groupsAlgebra universalis, 1985
- A Bound on Solutions of Linear Integer Equalities and InequalitiesProceedings of the American Mathematical Society, 1978