The order types of termination orderings on monadic terms, strings and multisets

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 624-635

  Martin, Ursula ^a   Scott, Elizabeth ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031481896     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275551     Document Type: Article

References (30)

1. A. BEN CHERIFA and P. LESCANNE, Termination of rewriting systems by polynomial interpretations and its implementation, Science of Computer Programming, vol. 9 (1987), pp. 137-160.
2. E. A. CICHON, Bounds on derivation lengths from termination proofs, International Journal of Foundations of Computer Science, to appear.
3. E. A. CICHON and P. LESCANNE, Polynomial interpretations and the complexity of algorithms. Proceedings of the 11th international conference on computer aided deduction, Lecture Notes in Computer Science, no. 607, Springer-Verlag, 1992.
4. M. DAUCHET, Simulation of Turing machines by a left linear rewrite rule, Proceedings of the 3rd international conference on term rewriting systems, Lecture Notes in Computer Science, no. 355, Springer-Verlag, 1989, pp. 109-120.
5. N. DERSHOWITZ, Orderings for term-rewriting systems, Theoretical Computer Science, vol. 17 (1982), pp. 279-301.
6. _, Termination of rewriting, Journal of Symbolic Computation, vol. 3 (1987), pp. 69-116.
7. N. DERSHOWITZ and Z. MANNA, Proving termination with multiset orderings, Comm ACM, vol. 22 (1979), pp. 465-476.
8. N. DERSHOWITZ and M. OKADA, Proof theoretic techniques for term rewriting theory, Proceedings of the third annual symposium on logic in computer science (Edinburgh), July 1988.
9. A. J. J. DICK, J. R. KALMUS, and U. MARTIN, Automating the Knuth Bendix ordering, Acta Informatica, vol. 28 (1990), pp. 95-119.
10. M. C. F. FERREIRA and H. ZANTEMA, Total termination of term rewriting, Applicable Algebra in Engineering, Communication and Computing, vol. 7 (1996), pp. 133-162.
11. 0? A survey of some results on proof theory, Annals of Pure and Applied Logic, vol. 53 (1991).
12. G. HIGMAN, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society, vol. 2 (1952), pp. 326-336.
13. D. HOFBAUER and C. LAUTEMANN, Termination proofs and the lengths of derivations (preliminary version), Proceedings of the 3rd international conference on term rewriting systems, Lecture Notes in Computer Science, vol. 355, Springer-Verlag, 1989, pp. 167-77.
14. J.-P. JOUANNAUD, P. LESCANNE, and F. REINIG, Recursive decomposition ordering, Formal description of programming concepts (D. Bjorner, editor), vol. 2, Elsevier, 1982, pp. 331-348.
15. S. KAMIN and J.-J. LEVY, Two generalisations of the recursive path ordering, Department of Computer Science, University of Illinois, Urbana, IL, 1980.
16. D. KNUTH and P. BENDIX, Simple word problems in universal algebras, Computational problems in abstract algebra (J. Leech, editor), Pergamon Press, 1970.
17. D. S. LANKFORD, On proving term rewriting systems are Noetherian, Tech report MTP-3, Louisiana Technical University, Ruston, 1979.
18. C. LAUTEMANN, A note on polynomial interpretation, Bulletin of the European Association for Theoretical Computer Science, vol. 4 (1988), pp. 129-131.
19. P. LESCANNE, Two implementations of the recursive path ordering on monadic terms, Proceedings of the 19th Allerton House conference on communication, control and computing, University of Illinois Press, 1981, pp. 634-643.
20. _, Termination of rewrite systems by elementary interpretations, Proceedings of the 3rd international conference on algebraic and logic programming, Lecture Notes in Computer Science, vol. 463, Springer-Verlag, 1992, pp. 21-36.
21. M. LOTHAIRE, Combinatorics on words, Encyclopaedia of mathematics and its applications, vol. 17, Addison Wesley, 1983.
22. U. MARTIN, A geometrical approach to multiset orderings, Theoretical Computer Science, vol. 67 (1989), pp. 37-54.
23. _, On the diversity of orderings on strings, Fundamenta lnformaticae, vol. 24 (1995), pp. 25-46.
24. F. L. MORRIS and C. B. JONES, An early proof by Alan Turing, Annals of the History of Computing, vol. 6 (1984), pp. 139-143.
25. P. NARENDRAN and M. RUSINOWITCH, Any ground associative-commutative theory has a finite canonical system, Proceedings of the 4th international conference on term rewriting systems, Springer Lecture Notes in Computer Science, vol. 488, pp. 423-434.
26. KO SAKAI, Knuth-Bendix algorithm for Thue system based on Kachinuki ordering, ICOT Technical Memorandum: TM-0087, December 1984.
27. C. C. SIMS, Verifying nilpotence, Journal of Symbolic Compulation, vol. 3 (1987), pp. 231-247.
28. A. M. TURING, Checking a large routine, Report of a conference on high speed automatic calculating machines, Univ. Math. Lab, Cambridge, 1949, pp. 67-69.
29. R. L. WILDER, Introduction to the foundations of mathematics, John Wiley & Sons, New York, 1965.
30. H. ZANTEMA, Termination of term rewriting by interpretation: Interpretation and type elimination, Journal of Symbolic Computation, vol. 17 (1994), pp. 23-50.