This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. A. Robinson, “A machine-oriented logic based on the resolution principle,” J. ACM, 12, No. 1 (1965).
J. R. Guard, “Automated logic for semiautomated mathematics,” Scientific Report AFCRL, No. 1, AD 602710 (1964).
G. P. Huet, “The undecidability of unification in third-order logic,” Inf. Control, 22, No. 3 (1973).
C. L. Lucchessi, “The undecidability of the unification problem for third-order languages,” Report CSRR 2059, Dept. of Applied Analysis and Computer Science, Univ. of Waterloo (1972).
A. A. Church, “A formulation of the simple theory of types,” J. Symb. Logic, 5, No. 1 (1940).
P. B. Andrews, “Resolution in type theory,” J. Symb. Logic, 36, No. 3 (1971).
G. P. Huet, “A unification algorithm for typed λ-calculus,” Theoret. Comp. Sci., 1, No. 1 (1975).
G. Winterstein, “Unification in second-order logic,” FB Informatik Univ. Kaiserslautern,3 (1976).
T. Pietrzykowski, “A complete mechanization of second-order logic,” J. ACM, 20, No. 2 (1971).
T. Pietrzykowski and D. Jensen, “A complete mechanization of ω-order logic type theory,” ACM Conf.,1 (1972).
D. Jensen and T. Pietrzykowski, “Mechanizing ω-order type theory through unification,” Theoret. Comp. Sci., 3, No. 2 (1976).
W. E. Gould, “A matching procedure for ω-order logic,” Scientific Report AFCRL, No. 4, AD 646560 (1966).
J. L. Darlington, “A partial mechanization of second order logic,” Machine Intelligence, Edinburgh Univ.,6 (1971).
G. S. Makanin, “Problem of solvability of equations in a free semigroup,” Mat. Sb., 103, No. 2 (1977).
Additional information
Translated from Kibernetika, No. 5, pp. 120–125, September–October, 1979.
Rights and permissions
About this article
Cite this article
Zhezherun, A.P. Decidability of the unification problem for second-order languages with unary functional symbols. Cybern Syst Anal 15, 735–741 (1979). https://doi.org/10.1007/BF01071228
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071228