Abstract. For two hierarchies of properties of term rewriting systems related to con uence and termination, respectively, we prove relative undecidability: for implications X) Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y.
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
We show that it is undecidable whether the intersection of the reflexive transitive closures of two ...
AbstractFor a hierarchy of properties of term rewriting systems related to termination we prove rela...
AbstractFor a hierarchy of properties of term rewriting systems related to confluence we prove relat...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractThis paper is on several basic properties of term rewrite systems: reachability, joinability...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
A property is called persistent if for any many-sorted term rewriting system , has the property if a...
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R,...
Abstract — A property is persistent if for any many-sorted term rewriting system , has the prope...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
A property is persistent if for any many-sorted term rewriting system , has the property if and only...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
We show that it is undecidable whether the intersection of the reflexive transitive closures of two ...
AbstractFor a hierarchy of properties of term rewriting systems related to termination we prove rela...
AbstractFor a hierarchy of properties of term rewriting systems related to confluence we prove relat...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractThis paper is on several basic properties of term rewrite systems: reachability, joinability...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
A property is called persistent if for any many-sorted term rewriting system , has the property if a...
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R,...
Abstract — A property is persistent if for any many-sorted term rewriting system , has the prope...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
A property is persistent if for any many-sorted term rewriting system , has the property if and only...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
We show that it is undecidable whether the intersection of the reflexive transitive closures of two ...
DOI
Add to ORKG