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

Vorobyov, Sergei

doi:10.1007/3-540-62950-5_76

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

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

https://rdcu.be/dvwWI
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Vorobyov, S. (1997). The First-order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. In H., Comon (Ed.), Rewriting Techniques and Applications (pp. 254-268). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3A1D-8

要旨

We construct a finite linear finitely terminating rewrite rule
system with undecidable theory of one step rewriting.