English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results

Degtyarev, A., Gurevich, Y., Narendran, P., Veanes, M., & Voronkov, A. (2000). Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results. Theoretical Computer Science, 243(1/2), 167-184.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Degtyarev, Anatoli, Author
Gurevich, Yuri, Author
Narendran, Paliath1, Author           
Veanes, Margus1, Author           
Voronkov, Andrei1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We show that simultaneous rigid $E$-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the A*EA*-fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the EE-fragment, we obtain {\em a complete classification of decidability of the prenex fragment of intuitionistic logic with equality, in terms of the quantifier prefix.} It is also proved that SREU with one variable and a constant bound on the number of rigid equations is P-complete. Moreover, we consider a case of SREU where one allows several variables, but each rigid equation either contains one variable, or has a ground left-hand side and an equality between two variables as a right-hand side. We show that SREU is decidable also in this restricted case.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-122000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519742
Other: Local-ID: C1256104005ECAFC-F9C6459652E4B317C125675B0068D57A-DGNVV99
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 243 (1/2) Sequence Number: - Start / End Page: 167 - 184 Identifier: -