1. Jürgen Avenhaus. On the descriptive power of term rewriting systems. J. Symbolic Computation, 2:109–122, 1986.
2. Leo Bachmair and Nachum Dershowitz. Equational inference, canonical proofs, and proof orderings. J. of the Association for Computing Machinery, to appear.
3. Leo Bachmair and Harald Ganzinger. Completion of first-order clauses with equality. In M. Okada, editor, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990. Lecture Notes in Computer Science, Springer, Berlin.
4. Leo Bachmair, Nachum Dershowitz, and Jieh Hsiang. Orderings for equational proofs. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 346–357, Cambridge, MA, June 1986.
5. Leo Bachmair, Nachum Dershowitz, and David A. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, chapter 1, pages 1–30. Academic Press, New York, 1989.