The undecidability of the second order predicate unification problem

Archive for Mathematical Logic 30 (3):193-199 (1990)
  Copy   BIBTEX

Abstract

We prove that the second order predicate unification problem is undecidable by reducing the second order term unification problem to it

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,471

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The undecidability of the DA-Unification problem.J. Siekmann & P. Szabó - 1989 - Journal of Symbolic Logic 54 (2):402 - 414.
Unification and explanation.Erik Weber & Maarten Van Dyck - 2002 - Synthese 131 (1):145 - 154.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Unification grammars and off-line parsability.Efrat Jaeger, Nissim Francez & Shuly Wintner - 2005 - Journal of Logic, Language and Information 14 (2):199-234.
On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.

Analytics

Added to PP
2013-12-01

Downloads
14 (#997,421)

6 months
5 (#649,144)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references