MPI-INF/SWS Research Reports 1991-2021
2. Number - only D2
MPI-I-98-2-009
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Vorobyov, Sergei
May 1998, 59 pages.
.Status: available - back from printing
By 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.
- Attachement: MPI-I-98-2-009.ps (449 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-2-009
BibTeX@TECHREPORT{Vorobyov98-2-009,
AUTHOR = {Vorobyov, Sergei},
TITLE = {The undecidability of the first-order theories of one step rewriting in linear canonical systems},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-98-2-009},
MONTH = {May},
YEAR = {1998},
ISSN = {0946-011X},
}