The word and generator problems for lattices
- 1 June 1988
- journal article
- Published by Elsevier in Information and Computation
- Vol. 77 (3) , 192-217
- https://doi.org/10.1016/0890-5401(88)90048-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Equational theories and database constraintsPublished by Association for Computing Machinery (ACM) ,1985
- Algebraic Structures with Hard Equivalence and Minimization ProblemsJournal of the ACM, 1984
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Free modular latticesTransactions of the American Mathematical Society, 1980
- Word problemsBulletin of the American Mathematical Society, 1978
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Undecidability of Some Topological TheoriesFundamenta Mathematicae, 1951
- The Word Problem for Abstract AlgebrasJournal of the London Mathematical Society, 1951
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947
- The decision problem for some classes of sentences without quantifiersThe Journal of Symbolic Logic, 1943