On equational theories, unification and decidability
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 204-215
- https://doi.org/10.1007/3-540-17220-3_18
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Unification under associativity and idempotence is of type nullaryJournal of Automated Reasoning, 1986
- Complexity of certain decision problems about congruential languagesJournal of Computer and System Sciences, 1985
- Combining unification algorithms for confined regular equational theoriesPublished by Springer Nature ,1985
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A Course in Universal AlgebraPublished by Springer Nature ,1981
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- The Concept of Demodulation in Theorem ProvingJournal of the ACM, 1967
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- Markov A.. Névozmožnost' algorifmov raspoznavaniá nékotoryh svojstv associativnyh sistém (Impossibility of algorithms for recognizing some properties of associative systems). Doklady Akadémii Nauk SSSR, vol. 77 (1951), pp. 953–956.The Journal of Symbolic Logic, 1952
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935