Skip to main content
SpringerLink
Log in

Algebraic and logical aspects of unification

  • Conference paper
  • First Online:
Word Equations and Related Topics (IWWERT 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 572))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. V. G. Durnev. Positive formulas on free semigroups. Sib. J. Math., 15:796–800, 1974.

    Google Scholar 

  5. 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. 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. 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. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.

    Google Scholar 

  9. G. S. Makanin. Equations in a free group. Math. USSR Izv., 21:483–546, 1983.

    Google Scholar 

  10. G. S. Makanin. Decidability of the universal and positive theories of a free group. Math.USSR Izv., 25: 75–88, 1985.

    Google Scholar 

  11. 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. W. V. Quine. Concatenation as a basis for arithmetic. Journal of Symbolic Logic, 11:105–114, 1946.

    Google Scholar 

  13. N.N. Repin. The solvability problem for equations in one unknown in nilpotent groups. Math. USSR Izv., 25:601–618, 1985.

    Google Scholar 

  14. 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. V. A. Roman'kov. Equations in free metabelian groups. Sib. J. Math., 20(1):469–471, 1979.

    Google Scholar 

  16. B. V. Rozenblat. Diophantine theories of free inverse semigroups. Sib. J. Math., 26(6):860–864, 1985.

    Google Scholar 

  17. J. H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207–274, 1989.

    Google Scholar 

  18. W. Szmielew. Elementary properties of abelian groups. Fund. Math., 41:203–271, 1955.

    Google Scholar 

  19. A. Tarski. Undecidable Theories (in collaboration with A. Mostowski and R. M. Robinson). North Holland, 1953.

    Google Scholar 

  20. Y. M. Vazhenin. On the elementary theory of free inverse semigroups. Semigroup Forum, 9:189–195, 1974.

    Google Scholar 

  21. 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. 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. A. P. Zamyatin. A non-abelian variety of groups has an undecidable elementary theory. Algebra and Logic, 17:13–17, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik Im Stadtwald, D-6600, Saarbrücken

    Alexander Bockmayr

Authors
  1. Alexander Bockmayr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. U. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bockmayr, A. (1992). Algebraic and logical aspects of unification. In: Schulz, K.U. (eds) Word Equations and Related Topics. IWWERT 1990. Lecture Notes in Computer Science, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55124-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-55124-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55124-9

  • Online ISBN: 978-3-540-46737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation