The first-order theory of one-step rewriting is undecidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 276-286

  Treinen, Ralf ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER THEORIES; FUNCTION SYMBOLS; GROUND TERMS; NON LINEAR; REWRITE RULES; REWRITE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84957699268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_59     Document Type: Conference Paper

References (16)

1. [B093] Ronald V. Book and Friedrich Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag, 1993.
2. [CCD93] Anne-Cécile Caron, Jean-Luc Coquide, and Max Dauchet. Encompassment properties and automata with constraints. In Kirchner [Kir93], pages 328- 342.
3. [DJ90] Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In van Leeuwen [vL90], chapter 6, pages 243-320.
4. [DJK93] Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop. More problems in rewriting. In Kirchner [Kir93], pages 468-487.
5. [DJK95] Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop. Problems in rewriting III. In Jieh Hsiang, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 914, pages 457-471. Springer- Verlag, April 1995.
6. [DT90] Max Dauchet and Sophie Tison. The theory of ground rewrite systems is decidable. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242-256. IEEE Computer Society Press, 1990.
7. [Hue80] Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, October 1980.
8. [Jac95] Florent Jacquemard. Personel Communication, December 1995.
9. [KB70] Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
10. [Kir93] Claude Kirchner, editor. Rewriting Techniques and Applications, 5th International Conference, RTA-93, Lecture Notes in Computer Science, vol. 690, Montreal, Canada, 1993. Springer Verlag.
11. [Pla85] David A. Plaisted. Semantic confluence tests and completion methods. Information and Computation, 65(2/3):182-215, 1985.
12. [Pos46] Emil L. Post. A variant of a recursively unsolvable problem. Bulletin of the AMS, 52:264-268, 1946.
13. [Tho90] Wolfgang Thomas. Automata on infinite objects. In van Leeuwen [vL90], chapter 4, pages 133-191.
14. [Tre92] Ralf Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14(5):437-457, November 1992.
15. [vL90] Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B - Formal Models and Semantics. Elsevier Science Publishers and The MIT Press, 1990.
16. [Vor95] Sergei Vorobyov. Elementary theory of one-step rewriting is undecidable (note). Draft, 1995.