The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable

Sergei G. Vorobyov. The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. In Hubert Comon, editor, Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings. Volume 1232 of Lecture Notes in Computer Science, pages 254-268, Springer, 1997.

@inproceedings{Vorobyov97:0,
  title = {The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable},
  author = {Sergei G. Vorobyov},
  year = {1997},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Vorobyov97%3A0},
  cites = {0},
  citedby = {0},
  pages = {254-268},
  booktitle = {Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings},
  editor = {Hubert Comon},
  volume = {1232},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62950-5},
}