The first-order theory of linear one-step rewriting is undecidable
✍ Scribed by Ralf Treinen
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 758 KB
- Volume
- 208
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
The theory of one-step rewriting for a given rewrite system R and signature C is the firstorder theory of the following structure: its universe consists of all C-ground terms, and its only predicate is the relation "x rewrites to y in one step by R". The structure contains no function symbols and no equality. We show that there is no algorithm deciding the 3*V*-fragment of this theory for an arbitrary finite, linear and non-erasing term-rewriting system.
With the same technique we prove that the theory of encompassment plus one-step rewriting by the rule f'(x) + y(x) and the modal theory of one-step rewriting are undecidable.
📜 SIMILAR VOLUMES
## Abstract First‐order phase transitions are modelled by a non‐homogeneous, time‐dependent scalar‐valued order parameter or phase field. The time dependence of the order parameter is viewed as arising from a balance law of the structure order. The gross motion is disregarded and hence the body is
## Abstract A method for the determination of the symmetry of first‐order vectors in Hartree–Fock perturbation theory is developed. This leads to the definition of symmetry‐adapted basis vectors to be employed at first order in the perturbation. It is shown that computer time can be saved, to some
## Abstract A method is described whereby molecular symmetry is employed to reduce the number of two‐electron integrals in perturbed Hartree–Fock calculations of second‐order properties. The method is a generalization of the Dacre–Elder procedure. First‐ and second‐rank perturbing tensor operators