Skip to main content
SpringerLink
Log in

The undecidability of the second order predicate unification problem

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Farmer, W.M.: Length of proofs and unification theory. Ph.D. Thesis, University of Wisconsin, Madison, 1984

    Google Scholar 

  2. Goldfarb, W.D.: The undecidability of the second-order unification problem. Theor. Comput. Sci.13, 225–230 (1981)

    Google Scholar 

  3. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Sov. Math. Dokl.18, 330–334 (1977)

    Google Scholar 

  4. Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Mach.12, 23–41 (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de Logique, CNRS UA 753, Université Paris 7, UFR de Mathématiques, 2 Place Jussieu, F-75251, Paris Cedex 05, France

    Gilles Amiot

Authors
  1. Gilles Amiot
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amiot, G. The undecidability of the second order predicate unification problem. Arch Math Logic 30, 193–199 (1990). https://doi.org/10.1007/BF01621471

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01621471

Keywords

Search

Navigation