✦ LIBER ✦

The unification hierarchy is undecidable

✍ Scribed by Werner Nutt

Book ID: 104681254
Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 637 KB
Volume: 7
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00249020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simple second-order languages for which

Simple second-order languages for which unification is undecidable

✍ William M. Farmer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Farmer, W.M., Simple second-order languages for which unification is undecidable, Theoretical Computer Science 87 (1991) 25-41. We improve Goldfarb's Theorem on the undecidability of the second-order unification problem. More precisely, we prove that there is a natural number n such that the unifica

The Undecidability of the Semi-unificati

The Undecidability of the Semi-unification Problem

✍ A.J. Kfoury; J. Tiuryn; P. Urzyczyn 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Positive undecidable numberings in the E

Positive undecidable numberings in the Ershov hierarchy

✍ M. Manat; A. Sorbi 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 818 KB

On the Undecidability of Second-Order Un

On the Undecidability of Second-Order Unification

✍ Jordi Levy; Margus Veanes 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 312 KB

The undecidability of simultaneous rigid

The undecidability of simultaneous rigid E-unification

✍ Anatoli Degtyarev; Andrei Voronkov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 559 KB

The undecidability of the second-order u

The undecidability of the second-order unification problem

✍ Warren D. Goldfarb 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 774 KB