History and basic features of the critical-pair/completion procedure
- 1 February 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 3 (1-2) , 3-38
- https://doi.org/10.1016/s0747-7171(87)80020-2
Abstract
No abstract availableKeywords
This publication has 68 references indexed in Scilit:
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Gröbner bases using SAC2Published by Springer Nature ,1985
- Bifurcation theory and computer algebra: An initial approachPublished by Springer Nature ,1985
- Constructions: A higher order proof system for mechanizing mathematicsPublished by Springer Nature ,1985
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- A simplified proof of the characterization theorem for Gröbner-basesACM SIGSAM Bulletin, 1980
- The diamond lemma for ring theoryAdvances in Mathematics, 1978
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Some properties of conversionTransactions of the American Mathematical Society, 1936
- ber unendliche diskontinuierliche GruppenMathematische Annalen, 1911