On equational theories, unification, and (Un)decidability
Open Access
- 8 July 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (1-2) , 3-49
- https://doi.org/10.1016/s0747-7171(89)80021-5
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Embedding boolean expressions into logic programmingJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- History and basic features of the critical-pair/completion procedureJournal of Symbolic Computation, 1987
- On equational theories, unification and decidabilityPublished by Springer Nature ,1987
- On unification: Equational theories are not boundedJournal of Symbolic Computation, 1986
- The theory of idempotent semigroups is of unification type zeroJournal of Automated Reasoning, 1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- The Word ProblemAnnals of Mathematics, 1959
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935