Peterson, Gerald E.; Stickel, Mark E. Complete sets of reductions for some equational theories. (English) Zbl 0479.68092 J. Assoc. Comput. Mach. 28, 233-264 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 90 Documents MSC: 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 08-04 Software, source code, etc. for problems pertaining to general algebraic systems Keywords:complete unification algorithms; unique termination property; finite termination property; well-founded partial order; Boolean algebra; extension of the Knuth-Bendix algorithm for finding complete sets of reductions; theory of a finite number of associative and commutative functions; free commutative groups; commutative rings with unit; distributive lattices PDF BibTeX XML Cite \textit{G. E. Peterson} and \textit{M. E. Stickel}, J. Assoc. Comput. Mach. 28, 233--264 (1981; Zbl 0479.68092) Full Text: DOI OpenURL