English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  The undecidability of the first-order theories of one step rewriting in linear canonical systems

Vorobyov, S.(1998). The undecidability of the first-order theories of one step rewriting in linear canonical systems (MPI-I-1998-2-009). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

Files

show Files
hide Files
:
1998-2-009 (Any fulltext), 10KB
Name:
1998-2-009
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
text/html / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Vorobyov, Sergei1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 1998
 Publication Status: Issued
 Pages: 59 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-2-009
Report Nr.: MPI-I-1998-2-009
BibTex Citekey: Vorobyov98-2-009
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -