Add to ORKGBy reduction from the halting problem for Minsky's two-register machines we prove that there is no algorithm capable of deciding the EAAA-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed such system with undecidable EA...A-theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded re...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractFor a hierarchy of properties of term rewriting systems related to termination we prove rela...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
By reduction from the halting problem for Minsky's two-register machines we prove that there is...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
We present an alternate undecidability proof for entailment in (intuitionistic) multiplicative sub-e...
AbstractGiven a term rewriting system R and a normalizable term t, a redex is needed if in any reduc...
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded re...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractFor a hierarchy of properties of term rewriting systems related to termination we prove rela...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
By reduction from the halting problem for Minsky's two-register machines we prove that there is...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
We present an alternate undecidability proof for entailment in (intuitionistic) multiplicative sub-e...
AbstractGiven a term rewriting system R and a normalizable term t, a redex is needed if in any reduc...
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded re...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractFor a hierarchy of properties of term rewriting systems related to termination we prove rela...