Unification in primal algebras, their powers and their varieties

This paper examines the unification problem in the class of primal algebras and the varieties they generate. An algebra is called primal if every function on its carrier can be expressed just in terms of the basic operations of the algebra. The two-element Boolean algebra is the simplest nontrivial example: Every truth-function can be realized in terms of the basic connectives, for example, negation and conjunction. It is shown that unification in primal algebras is unitary, that is, if an equation has a solution, it has a single most general one. Two unification algorithms, based on equation-solving techniques for Boolean algebras due to Boole and Lo¨wenheim, are studied in detail. Applications include certain finite Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic. Then unification is extended from primal algebras to their direct powers, which leads to unitary unification algorithms covering finite Post algebras, finite, semisimple Artinian rings, and finite, semisimple nonabelian groups. Finally the fact that the variety generated by a primal algebra coincides with the class of its subdirect powers is used. This yields unitary unification algorithms for the equational theories of Post algebras and p-rings.

[1]  Jieh Hsiang,et al.  Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[2]  Manfred Schmidt-Schauß.  Unification in a Combination of Arbitrary Disjoint Equational Theories , 1988, CADE.

[3]  Sergiu Rudeanu.  Boolean functions and equations , 1974 .

[4]  E. Schröder.  Vorlesungen uber die Algebra der Logik , 1967 .

[5]  D. Montgomery,et al.  A representation of generalized Boolean rings , 1937 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Paliath Narendran,et al.  Matching, unification and complexity , 1987, SIGS.

[8]  M. Stone,et al.  The Theory of Representation for Boolean Algebras , 1936 .

[9]  Alfred L. Foster.  Generalized “Boolean” theory of universal algebras , 1953 .

[10]  Manfred Schmidt-Schauß,et al.  Unification in a Combination of Arbitrary Disjoint Equational Theories , 1988, J. Symb. Comput..

[11]  R. A. Knoebel,et al.  Simplicity vis-à-vis functional completeness , 1970 .

[12]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[13]  Erik Tidén.  Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols , 1986, CADE.

[14]  George Boole,et al.  The mathematical analysis of logic , 1948 .

[15]  Paul C. Rosenbloom,et al.  Post algebras I. Postulates and general theory , 1942 .

[16]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[17]  Katherine A. Yelick,et al.  Unification in Combinations of Collapse-Free Regular Theories , 1987, J. Symb. Comput..

[18]  Wolfram Büttner,et al.  Embedding Boolean Expressions into Logic Programming , 1987, J. Symb. Comput..

[19]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

[20]  Tobias Nipkow,et al.  Boolean Unification - The Story So Far , 1989, J. Symb. Comput..

[21]  A. Pixley,et al.  Semi-categorical algebras. I , 1964 .

[22]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[23]  H. Comon.  Sufficient Completness, Term Rewriting Systems and Anti-Unification , 1986 .

[24]  Stephen J. Garland,et al.  An Overview of LP, The Larch Power , 1989, RTA.

[25]  Alfred L. Foster.  Generalized “Boolean” theory of universal algebras , 1953 .

[26]  H. Rasiowa.  An Algebraic Approach To Non Classical Logics , 1974 .