Handbook of theoretical computer science (vol. B)
Automata for reduction properties solving
Journal of Symbolic Computation
Grid Structure and Undecidable Constraint Theories
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
The First-Order Theory of One-Step Rewriting is Undecidable
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Undecidability of the First Order Theory of One-Step Right Ground Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Computation: finite and infinite machines
Computation: finite and infinite machines
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
By reduction form the halting problem for Minsky's two-register machines we prove that there is no algorithm capable of deciding the XXXXX-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed system with undecidable XXX_theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind.