Concurrent term rewriting as a model of computation
Proc. of a workshop on Graph reduction
The first-order theory of linear one-step rewriting is undecidable
Theoretical Computer Science - Special issue on rewriting techniques and applications
On the undecidability of second-order unification
Information and Computation - Special issue on RTA-98
On rewrite constraints and context unification
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Graph rewrite systems for program optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Grid structures and undecidable constraint theories
Theoretical Computer Science
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Grid Structure and Undecidable Constraint Theories
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A New Result about the Decidability of the Existential One-Step Rewriting Theory
RtA '99 Proceedings of the 10th 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
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Toward the Concurrent Implementation of Computational Systems
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
| Hi-index | 0.00 |
It is known that the first-order theory with a single predicate *** that denotes a one-step rewriting reduction on terms is undecidable already for formulae with *** *** prefix. Several decidability results exist for the fragment of the theory in which the formulae start with the *** prefix only. This paper considers a similar fragment for a predicate *** p which denotes the parallel one-step rewriting reduction. We show that the first-order theory of *** p is undecidable already for formulae with *** 7 prefix and left-linear rewrite systems.