$\forall\exists^5$-equational theory of context unification is undecidable

Vorobyov, Sergei

Local TagsRelease HistoryDetailsSummary

$\forall\exists^5$-equational theory of context unification is undecidable

Vorobyov, S. (2002). $\forall\exists^5$-equational theory of context unification is undecidable. Theoretical Computer Science, 275, 463-479.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F95-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F96-6

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Vorobyov, Sergei^{1, 2}, Author

Affiliations:
1Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society, ou_40046
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-07-29Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202167
Other: Local-ID: C1256104005ECAFC-918F900524C87A16C1256AAF0043B0B9-Vorobyov2000-aecu

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: 275 Sequence Number: - Start / End Page: 463 - 479 Identifier: -