Primitive rewriting

Nachum Dershowitz

doi:10.1007/11601548_10

Primitive rewriting

Nachum Dershowitz^*

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-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 language	English
Title of host publication	Processes, Terms and Cycles
Subtitle of host publication	Steps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
Publisher	Springer Verlag
Pages	127-147
Number of pages	21
ISBN (Print)	354030911X, 9783540309116
DOIs	https://doi.org/10.1007/11601548_10
State	Published - 2005

Publication series

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

Access to Document

10.1007/11601548_10

Cite this

Dershowitz, N. (2005). Primitive rewriting. In Processes, Terms and Cycles: Steps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday (pp. 127-147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3838 LNCS). Springer Verlag. https://doi.org/10.1007/11601548_10

@inbook{d594c701b48146e6b21dec6d635a270c,

title = "Primitive rewriting",

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.",

author = "Nachum Dershowitz",

year = "2005",

doi = "10.1007/11601548_10",

language = "אנגלית",

isbn = "354030911X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "127--147",

booktitle = "Processes, Terms and Cycles",

address = "גרמניה",

}

Dershowitz, N 2005, Primitive rewriting. in Processes, Terms and Cycles: Steps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3838 LNCS, Springer Verlag, pp. 127-147. https://doi.org/10.1007/11601548_10

Primitive rewriting. / Dershowitz, Nachum.
Processes, Terms and Cycles: Steps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. Springer Verlag, 2005. p. 127-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3838 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Primitive rewriting

AU - Dershowitz, Nachum

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=37149038454&partnerID=8YFLogxK

U2 - 10.1007/11601548_10

DO - 10.1007/11601548_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:37149038454

SN - 354030911X

SN - 9783540309116

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

SP - 127

EP - 147

BT - Processes, Terms and Cycles

PB - Springer Verlag

ER -

Primitive rewriting

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this