Algebraic and logical aspects of unification

  • Alexander Bockmayr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 572)


During the last years unification theory has become an important subfield of automated reasoning and logic programming. The aim of the present paper is to relate unification theory to classical work on equation solving in algebra and mathematical logic. We show that many problems in unification theory have their counterpart in classical mathematics and illustrate by various examples how classical results can be used to answer unification-theoretic questions.


Word Problem Inverse Semigroup Nilpotent Group Elementary Theory Variable Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Boc87]
    A. Bockmayr. A note on a canonical theory with undecidable unification and matching problem. Journal of Automated Reasoning, 3:379–381, 1987.Google Scholar
  2. [Boc89]
    A. Bockmayr. On the decidability of the unification problem. In UNIF 89, Extended Abstracts of the 3rd International Workshop on Unification, Lambrecht (Pfalz), SEKI SR-89-17. Univ. Kaiserslautern, 1989.Google Scholar
  3. [BSS89]
    H. J. Bürckert and M. Schmidt-Schauß. On the solvability of equational problems. Technical Report SEKI SR-89-07, Univ. Kaiserslautern, June 1989.Google Scholar
  4. [Dur74]
    V. G. Durnev. Positive formulas on free semigroups. Sib. J. Math., 15:796–800, 1974.Google Scholar
  5. [HH87]
    S. Heilbrunner and S. Hölldobler. The undecidability of the unification and matching problem for canonical theories. Acta Inform., 24:157–171, 1987.Google Scholar
  6. [HO80]
    G Huet and D. C. Oppen. Equations and rewrite rules, A survey. In R. V. Book, editor, Formal Language Theory. Academic Press, 1980.Google Scholar
  7. [JK91]
    J. P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of A. Robinson. MIT Press, 1991.Google Scholar
  8. [Mak77]
    G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.Google Scholar
  9. [Mak83]
    G. S. Makanin. Equations in a free group. Math. USSR Izv., 21:483–546, 1983.Google Scholar
  10. [Mak85]
    G. S. Makanin. Decidability of the universal and positive theories of a free group. Math.USSR Izv., 25: 75–88, 1985.Google Scholar
  11. [Mar82]
    S. S. Marchenkov. Undecidability of the positive ∀∃-theory of a free semigroup (in Russian). Sibirsk. Mat. Zh., 23:196–198, 1982. MR 83e: 03067.Google Scholar
  12. [Qui46]
    W. V. Quine. Concatenation as a basis for arithmetic. Journal of Symbolic Logic, 11:105–114, 1946.Google Scholar
  13. [Rep85]
    N.N. Repin. The solvability problem for equations in one unknown in nilpotent groups. Math. USSR Izv., 25:601–618, 1985.Google Scholar
  14. [Rep88]
    N. N. Repin. Some simply presented groups for which an algorithm recognizing solvability of equations is impossible (in Russian). Vopr. Kibern., Mosk., 134:167–175, 1988. MR 89i: 20057.Google Scholar
  15. [Rom79]
    V. A. Roman'kov. Equations in free metabelian groups. Sib. J. Math., 20(1):469–471, 1979.Google Scholar
  16. [Roz85]
    B. V. Rozenblat. Diophantine theories of free inverse semigroups. Sib. J. Math., 26(6):860–864, 1985.Google Scholar
  17. [Sie89]
    J. H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207–274, 1989.Google Scholar
  18. [Szm55]
    W. Szmielew. Elementary properties of abelian groups. Fund. Math., 41:203–271, 1955.Google Scholar
  19. [Tar53]
    A. Tarski. Undecidable Theories (in collaboration with A. Mostowski and R. M. Robinson). North Holland, 1953.Google Scholar
  20. [Vaz74]
    Y. M. Vazhenin. On the elementary theory of free inverse semigroups. Semigroup Forum, 9:189–195, 1974.Google Scholar
  21. [VR83a]
    Y. M. Vazhenin and B. V. Rozenblat. Decidability of the positive theory of a free countably generated semigroup. Math. USSR Sbornik, 44:109–116, 1983.Google Scholar
  22. [VR83b]
    Y. M. Vazhenin and B. V. Rozenblat. On positive theories of free algebraic systems. Sov. Math. (Izv. VUZ), 27(3):88–91, 1983.Google Scholar
  23. [Zam78]
    A. P. Zamyatin. A non-abelian variety of groups has an undecidable elementary theory. Algebra and Logic, 17:13–17, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Alexander Bockmayr
    • 1
  1. 1.Max-Planck-Institut für Informatik Im StadtwaldSaarbrücken

Personalised recommendations