Abstract
Unification is a fundamental operation in various areas of computer science, in particular in automated theorem proving and logic programming. In this paper we establish a relation between unification theory and classical model theory. We show how model-theoretic methods can be used to investigate a generalized form of unification, namely the problem whether, given an equational theory E and a system of equations S, there is an extension of the free algebra in E in which S is solvable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bockmayr. A note on a canonical theory with undecidable unification and matching problem. Journal of Automated Reasoning, 3:379–381, 1987.
S. Burris. Decidable model companions. Zeitschr. f. math. Logik und Grundlagen d. Math., 35:225–227, 1989.
G. Cherlin. Algebraically closed commutative rings. Journal of Symbolic Logic, 38:493–499, 1973.
G. Cherlin. Model-Theoretic Algebra — Selected Topics, volume 521 of Lecture Notes in Mathematics. Springer-Verlag, 1976.
M. Davis, Y. Matiyasevich, and J. Robinson. Hilbert's tenth problem. Diophantine equations: Positive aspects of a negative solution. Proc. Symp. Pure Math., 28:323–378, 1976.
K. Dörge. Bemerkungen über Elimination in beliebigen Mengen mit Operationen. Mathematische Nachrichten, 4:282–297, 1951.
K. Dörge. Über die Lösbarkeit allgemeiner algebraischer Gleichungssysteme und einige weitere Fragen. Mathematische Annalen, 171:1–21, 1967.
P. Eklof and G. Sabbagh. Model completions and modules. Ann. Math. Logic, 2:251–295, 1971.
G Huet and D. C. Oppen. Equations and rewrite rules, A survey. In R. V. Book, editor, Formal Language Theory. Academic Press, 1980.
G. Huet. A complete proof of the Knuth-Bendix completion procedure. J. Comp. Syst. Sc., 23:11–21, 1981.
J. Hirschfeld and W. H. Wheeler. Forcing, Arithmetic, Division Rings, volume 454 of Lecture Notes in Mathematics. Springer-Verlag, 1975.
J. P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Inform. and Comput., 82:1–33, 1989.
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.
H. J. Keisler. Fundamentals of model theory. In J. Barwise, editor, Handbook of Mathematical Logic. North Holland, 1977.
K. Knight. Unification, a multidisciplinary survey. ACM Comp. Surveys, 21:93–124, 1989.
A. Macintyre. On algebraically closed groups. Annals of Math., 96:53–97, 1972.
A. Macintyre. Model completeness. In J. Barwise, editor, Handbook of Mathematical Logic. North Holland, 1977.
M. Parigot. Le modèle compagnon de la théorie des arbres. Zeitschr. f. math. Logik und Grundlagen d. Math., 29:137–150, 1983.
D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:233–264, 1985.
A. Robinson. On the Metamathematics of Algebra. North Holland, 1951.
A. Robinson. Introduction to Model Theory and to the Metamathematics of Algebra. North Holland, 1963.
P. H. Schmitt. Algebraically complete lattices. Algebra Universalis, 17:135–142, 1983.
J. H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207–274, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bockmayr, A. (1992). Model-theoretic 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_7
Download citation
DOI: https://doi.org/10.1007/3-540-55124-7_7
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