Advertisement

Scott's conjecture is true, position sensitive weights

  • Samuel M. H. W. Perlo-Freeman
  • Péter Prőhle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1232)

Abstract

The classification of total reduction orderings for strings over a 2-letter alphabet w.r.t. monoid presentations with 2 generators was published by U. Martin, see [9], and used the hypothetical truth of Scott's conjecture, which was 3 years old in 1996.

Now the results due to Ursula Martin and Elizabeth Scott are completed with the truth of Scott's conjecture. The final proof is simple, but we had difficulties. E. Scott proved the case, when some invariant takes the value either 0, or a positive rational or ∞, see [15]. Later we proved the case of positive reals which are well approximable to arbitrary order, see [11], and then the case of \({}^n\sqrt k\) and the case of λ where both of λ and λ−1 are algebraic integers, like √5−1/2.

It is a challenging problem, whether there is a reasonably small subset G\(\subseteq\)a,b*x a,b* such that each total reduction ordering ≻ of {a, b}* is uniquely determined by its restriction to G.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben Cherifa, A., Lescanne, P.: Termination of Rewriting Systems by Polynomial Interpretations and its Implementation, Science of Computer Programming, 9 (1987) 137–160.CrossRefGoogle Scholar
  2. 2.
    Dershowitz, N.: Orderings for Term-Rewriting Systems, Theoretical Computer Science, 17 (1982) 279–301.CrossRefGoogle Scholar
  3. 3.
    Dershowitz, N.: Termination of Rewriting, J. Symbolic Computation, 3 (1987) 69–116.Google Scholar
  4. 4.
    Higman, G.: Ordering by Divisibility in Abstract Algebras, Proc. London Math. Soc. 2 (1952) 326–336.Google Scholar
  5. 5.
    Knuth, D., Bendix, P.: Simple Word Problems in Universal Algebras, in: J. Leech, ed., Computational Problems in Abstract Algebra, (Pergamon, Oxford, 1970).Google Scholar
  6. 6.
    Lescanne, P.: Two Implementations of the Recursive Path Ordering on Monadic Terms, Proc. 19th Allerton House Conference on Communication, Control and Computing (University of Illinois Press, Urbana, 1981) 634–643.Google Scholar
  7. 7.
    Martin, U.: A Note on Division Orderings on Strings, Information Processing Letters, 36 (1990) 237–240.Google Scholar
  8. 8.
    Martin, U.: Linear interpretations by counting patterns, Springer Lecture Notes in Computer Science 690, 5th International Conference on Rewriting Techniques and Applications, Montreal, 1993Google Scholar
  9. 9.
    Martin, U.: On the Diversity of Orderings on Strings, Fundamentae Informaticae 24 (1995) 25–46.Google Scholar
  10. 10.
    Martin, U., Scott, E. A.: The Order Types of Termination Orderings on Terms, Strings and Multisets, The Proceedings on the 8th Annual IEEE conference on Logic in Computer Science, Montreal, ed. M. Vardi, IEEE Computer Society Press, (1993) 356–363.Google Scholar
  11. 11.
    Prőhle, P., Scott, E. A.: Scott's conjecture is true for the case of positive reals which are well approximable to arbitrary order, Manuscript, 1996.Google Scholar
  12. 12.
    Prőhle, P.: Classification of total reduction orderings w.r.t. monoid presentations with 2 generators, Manuscript, 1996.Google Scholar
  13. 13.
    Sakai, K.: Knuth-Bendix Algorithm for Thue System Based on Kachinuki Ordering, Tech. Report TM-0087, Institute for New Generation Computer Technology, ICOT Tokyo, 1984.Google Scholar
  14. 14.
    Scott, E. A.: Weights for Total Division Orderings on Strings, Theoretical Computer Science, 135 (1994) 345–359.CrossRefGoogle Scholar
  15. 15.
    Scott, E. A.: Division orderings given by matrices, Technical Report at Royal Holloway University of London (1993); new extended version: Total Division Orderings Of Order Type ω2, Manuscript (1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Samuel M. H. W. Perlo-Freeman
    • 1
  • Péter Prőhle
    • 2
    • 3
  1. 1.Mathematics InstituteUniversity of WarwickCoventryUK
  2. 2.Computer Science DivisionUniversity of St AndrewsSt AndrewsScotland
  3. 3.Depth of Algebra and NumbertheoryEötvös Loránd UniversityBudapestHungary

Personalised recommendations