Union of Equational Theories: An Algebraic Approach

  • Piotr Hoffman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3467)


We consider the well-known problem of deciding the union of decidable equational theories. We focus on monadic theories, i.e., theories over signatures with unary function symbols only. The equivalence of the category of monadic equational theories and the category of monoids is used. This equivalence facilitates a translation of the considered decidability problem into the word problem in the pushout of monoids which themselves have decidable word problems. Using monoids, existing results on the union of theories are then restated and proved in a succint way. The idea is then analyzed of first guaranteeing that the union is a “jointly conservative” extension and then using this property to show decidability of the union. It is shown that “joint conservativity” is equivalent to the corresponding monoid amalgam being embeddable; this allows one to apply results from amalgamation theory to this problem. Then we prove that using this property to show decidability is a more difficult matter: it turns out that even if this property and some additional conditions hold, the problem remains undecidable.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BT02]
    Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Information and Computation 178(2), 346–390 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  2. [FG03]
    Fiorentini, C., Ghilardi, S.: Combining word problems through rewriting in categories with products. Theoretical Computer Science 294, 103–149 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. [Hal78]
    Hall, T.E.: Amalgamation and inverse and regular semigroups. Transactions of the AMS 246, 395–406 (1978)zbMATHCrossRefGoogle Scholar
  4. [Hig92]
    Higgins, P.M.: Techniques of Semigroup Theory. Oxford University Press, Oxford (1992)zbMATHGoogle Scholar
  5. [How96a]
    Howie, J.M.: Fundamentals of Semigroup Theory. London Mathematical Society Monographs, New Series, vol. 12. Oxford University Press, Oxford (1996)Google Scholar
  6. [How96b]
    Howie, J.M.: Isbell’s zigzag theorem and its consequences. In: Hofmann, K.H., Mislove, M.W. (eds.) Semigroup Theory and its Applications, Proceedings of the 1994 Conference Commemorating the Work of Alfred H. Clifford, New Orleans, LA, London. Mathematical Society Lecture Notes Series, vol. 231, pp. 81–91. Cambridge University Press, Cambridge (1996)Google Scholar
  7. [Isb66]
    Isbell, J.R.: Epimorphisms and dominions. In: Proceedings of Conference on Categorical Algebra, La Jolla, California, pp. 232–246. Springer, Heidelberg (1966)Google Scholar
  8. [Lei04]
    Leinster, T.: Higher Operads, Higher Categories. In: Main, M.G., Mislove, M.W., Melton, A.C., Schmidt, D. (eds.) MFPS 1987. LNCS, vol. 298, Springer, Heidelberg (1988)Google Scholar
  9. [Pig74]
    Pigozzi, D.: The join of equational theories. Colloquium Mathematicum 30(1), 15–25 (1974)zbMATHMathSciNetGoogle Scholar
  10. [Ren86a]
    Renshaw, J.: Extension and amalgamation in monoids and semigroups. Proceedings of the London Mathematical Society 52(3), 119–141 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  11. [Ren86b]
    Renshaw, J.: Flatness and amalgamation in monoids. Journal of the London Mathematical Society 33(2), 73–88 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Sap00]
    Sapir, M.V.: Algorithmic problems for amalgams of finite semigroups. Journal of Algebra 229(2), 514–531 (2000)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Piotr Hoffman
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarszawaPoland

Personalised recommendations