English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  The first-order theory of one step rewriting in linear noetherian systems is undecidable

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Vorobyov, Sergei1, 2, Author           
Affiliations:
1Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society, ou_40046              
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one step rewriting.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519463
Other: Local-ID: C1256104005ECAFC-0D60796ECA1D1B79C1256457004A7EEC-Vorobyov97RTA97
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Sitges, Spain
Start-/End Date: 1997

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97)
Source Genre: Proceedings
 Creator(s):
Comon, Hubert, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 254 - 268 Identifier: ISBN: 3-540-62950-5

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1232 Sequence Number: - Start / End Page: - Identifier: -