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

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

Volumn 1232, Issue , 1997, Pages 254-268

  Vorobyov, Sergei ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER THEORIES; REWRITE RULES;

ARTIFICIAL INTELLIGENCE;

EID: 84947725457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_76     Document Type: Conference Paper

References (4)

1. W. V. Quine. Concatenation as a basis for arithmetic. J. Symb. Logic, 11(4): 105-114, 1946.
2. R. Treinen. The first-order theory of one step rewriting is undecidable. In Rewriting Techniques and Applications'96, Lect. Notes Comput. Sei., pages 276-285. SpringerVerlag, 1996.
3. S. Vorobyov. The elementary theory of one-step rewriting is undecidable (note). Unpublished draft, see http://www.mpi-sb.mpg/~sv/, Section "On Trees and Rewriting", 1995.
4. S. Vorobyov. 3V3-theories of one step rewriting in linear noetherian systems are undecidable. Available at http://www.mpi~sb.mpg.de/~sv, November 1996.