A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy
-
Published:2015-03-21
Issue:2
Volume:16
Page:1-9
-
ISSN:1529-3785
-
Container-title:ACM Transactions on Computational Logic
-
language:en
-
Short-container-title:ACM Trans. Comput. Logic
Affiliation:
1. University of Copenhagen, Denmark
Abstract
A full and finitely generated Church-Rosser term rewriting system is presented that has no computable one-step, normalizing strategy; the system is both left- and right-linear. The result provides a negative answer to a question posed by Kennaway in 1989: Number 10 on the List of Open Problems in Rewriting.
Funder
Danish Council for Independent Research Sapere Aude grant Complexity through Logic and Algebra
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science