Formal translation monoid and algebra congruences in a monoidal category
Article
Received:
Revised:
- 19 Downloads
Abstract
In a monoidal category we characterize algebra congruences using the free approximation of their translation monoid. We then construct explicitely the congruence generated by a relation and cogenerated by an equivalence.
Keywords
Monoidal Category Formal Translation Free Approximation Algebra Congruence
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Anderson, B. D. O., Arbib, M. A., Manes, E. G.: Foundations of System Theory: Finitary and Infinitary Conditions. Lect. Notes Econ. Math. Systems 115. Berlin-Heidelberg-New York: Springer. 1974.Google Scholar
- [2]Cohn, P.:Universal Algebra. New York: Harper & Row. 1965.Google Scholar
- [3]Ehrig, H., Kühnel, W.: Topological automata. Revue Franc. Autom. Inform. Rech. Operat.8, R-3 73–91 (1974).Google Scholar
- [4]Grätzer, G.: Universal Algebra. Berlin-Heidelberg-New York: Springer. 1979.Google Scholar
- [5]Muir, A., Warner, M. W.: Homogeneous tolerance spaces. Czechosl. Mat. J.30 (105), 118–126 (1980).Google Scholar
- [6]Slominski, J.: On the greatest congruence relation contained in an equivalence relation and its application to the algebraic theory of machines. Colloq. Math.29, 31–43 (1974).Google Scholar
Copyright information
© Springer-Verlag 1982