✦ LIBER ✦

The Subtyping Problem for Second-Order Types Is Undecidable

✍ Scribed by Jerzy Tiuryn; Paweł Urzyczyn

Book ID: 112252600
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 154 KB
Volume: 179
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.2001.2950

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 second order p

The undecidability of the second order predicate unification problem

✍ Gilles Amiot 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 397 KB

The equivalence problem for deterministi

The equivalence problem for deterministic TOL-systems is undecidable

✍ G. Rozenberg 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The equivalence problem for deterministi

The equivalence problem for deterministic T0L-systems is undecidable

✍ Grzegorg Rozenberg 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The Implication Problem for Functional a

The Implication Problem for Functional and Inclusion Dependencies is Undecidable

✍ Chandra, Ashok K.; Vardi, Moshe Y. 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 838 KB