Primitive rewriting

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post's Correspondence Problem. Another natural candidate for proofs regarding term rewriting is Recursion Theory, a direction we promote in this contribution. We present some undecidability results for "primitive" term rewriting systems, which encode primitive-recursive definitions, in the manner suggested by Klop. We also reprove some undecidability results for orthogonal and non-orthogonal rewriting by applying standard results in recursion theory.

Original languageEnglish
Title of host publicationProcesses, Terms and Cycles
Subtitle of host publicationSteps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
PublisherSpringer Verlag
Pages127-147
Number of pages21
ISBN (Print)354030911X, 9783540309116
DOIs
StatePublished - 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3838 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Primitive rewriting'. Together they form a unique fingerprint.

Cite this