English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The first-order theory of one step rewriting in linear noetherian systems is undecidable

MPS-Authors
/persons/resource/persons45677

Vorobyov,  Sergei
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Vorobyov, S. (1997). The first-order theory of one step rewriting in linear noetherian systems is undecidable. In H. Comon (Ed.), Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97) (pp. 254-268). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3A1D-8
Abstract
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one step rewriting.