Guttag, J. V.; Kapur, D.; Musser, D. R. On proving uniform termination and restricted termination of rewriting systems. (English) Zbl 0526.68036 SIAM J. Comput. 12, 189-214 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 18 Documents MSC: 68Q65 Abstract data types; algebraic specification 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) Keywords:uniform termination; restricted termination; global finiteness; rewrite rules; confluence; Knuth-Bendix algorithm; overlap closure; canonical; rewrite dominoes; equational axioms; term rewriting systems PDFBibTeX XMLCite \textit{J. V. Guttag} et al., SIAM J. Comput. 12, 189--214 (1983; Zbl 0526.68036) Full Text: DOI