2002
DOI: 10.1006/inco.2002.3120
|View full text |Cite
|
Sign up to set email alerts
|

Relative Undecidability in Term Rewriting

Abstract: For two hierarchies of properties of term rewriting systems related to con uence and termination, respectively, w e prove relative undecidability : for implications X Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2005
2005
2011
2011

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
references
References 34 publications
0
0
0
Order By: Relevance