Abstract
Unification in primal algebras is shown to be unitary. Three different unification algorithms are investigated. The simplest one consists of computing all solutions and coding them up in a single vector of terms. The other two methods are generalizations of unification algorithms for Boolean algebras.
Two applications are studied in more detail: Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic.
It is indicated that the results extend to arbitrary varieties of primal algebras which include all Boolean and Post algebras and p-rings.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Barringer, J.H. Cheng, C.B. Jones: A Logic Covering Undefinedness in Program Proofs, Acta Informatica 21, 251–269, 1984
G. Boole: The Mathematical Analysis of Logic, Macmillan 1847. Reprinted 1948, B. Blackwell.
W. Büttner, H. Simonis: Embedding Boolean Expressions into Logic Programming, to appear in Journal of Symbolic Computation, 1987
J.H. Cheng: A Logic for Partial Functions, Ph.D. Thesis, Dept. of Comp. Sci., The University of Manchester, 1986
H. Comon: Sufficient Completeness, Term Rewriting Systems and Anti-Unification, in: 8th Int. Conf. on Automated Deduction, LNCS 230, 1986
A.L. Foster: Generalized “Boolean” Theory of Universal Algebra, Math. Zeitschr. 59, 1953, 191–199
A.L. Foster, A. Pixley: Semi-Categorical Algebras. I. Semi-Primal Algebras, Math. Zeitschr. 83, 1964, 147–169
M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, San Francisco, 1979
G. Grätzer: Universal Algebra, Second Edition, Springer Verlag, 1979
I.N. Herstein: Noncommutative Rings, The Mathematical Association of America, 1968
R.A. Knoebel: Simplicity vis-à-vis Functional Completeness, Math. Ann. 189 (1970), 299–307
L. Löwenheim: Über das Auflösungsproblem im logischen Klassenkalkül, Sitzungsber. Berl. Math. Gesell. 7, 89–94, 1908
U. Martin, T. Nipkow: Unification in Boolean Rings, in: 8th Int. Conf. on Automated Deduction, LNCS 230, 1986, 506–513
U. Martin, T. Nipkow: Boolean Unification — A Survey, to appear in Journal of Symbolic Computation
T. Nipkow: Unification in Primal Algebras, their Powers and their Varieties, in preparation
E.L. Post: Introduction to a General Theory of Elementary Propositions, Amer. J. Math. 43, 163–185, 1921
H. Rasiowa: An Algebraic Approach to Non-Classical Logics, North-Holland, 1974
S. Rudeanu: Boolean Functions and Equations, North-Holland, 1974
E. Schröder: Vorlesungen über die Algebra der Logik, (Leipzig, Vol 1, 1890; Vol 2, 1891, 1905; Vol 3, 1895), Reprint 1966, (Chelsea, Bronx NY)
M.H. Stone: The Theory of Representation for Boolean Algebras, Trans. Amer. Math. Soc. 40, 1936, 37–111
E. Tidén: Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols, in 8th International Conference on Automated Deduction, Lecture Notes in Computer Science 230, Springer 1986, 431–449
H. Werner: Einführung in die allgemeine Algebra, Bibliographisches Institut, Mannheim, Wien, Zürich, 1978
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nipkow, T. (1988). Unification in primal algebras. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026100
Download citation
DOI: https://doi.org/10.1007/BFb0026100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19021-9
Online ISBN: 978-3-540-38930-9
eBook Packages: Springer Book Archive