The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |