Abstract
We discuss formal treatments of composition and terms in universal algebra, propositional logics etc. which may serve as an indispensable base for computer programs capable of term building and term comparison, an important problem in theoretical computer science. After a survey we discuss various Mal'cev algebras introduced for this purpose: preiterative, preiterative with identity, iterative and postiterative. These algebras seem to be simple to implement. We then show how these algebras allow to bring certain universal algebra concepts (as varieties and subvarieties, interpretation and hyperidentities) one conceptual level down. We conclude with a list of properties of preiterative algebras.
The paper is in final form and no version of it will be submitted for publication elsewhere.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Cohn, B.M., Universal Algebra, Harper and Row, New York, 1965; second edition: D. Reidel Publ. Co. Dordrecht, Boston, London 1981.
Coxeter, H.S.M.; Moser, W.O.J., Generators and relations for discrete groups. Ergeb. d. Math. u. ihrer Grenzgebiete 14, Springer Verlag 1972.
Garcia, D.C.; Taylor, W.F., The lattice of interpretability types of varieties. Mem. Amer. Math. Soc. (50) 1984, no. 305, v+125 pp.
Grätzer, G., Universal algebra. D. van Nostrand Co., Princeton N.J. 1968, 2nd edition Birkhauser Verlag Basel 1979.
Jablonskii, S.V., Functional constructions in a k-valued logic (Russian). Trudg Mat. Inst. Steklov 51 (1958) 5–142.
Janov, Ju.I.; Mucnik, A.A., Existence of k-valued closed classes without a finite basis (Russian). Dokl. Akad. Nauk SSSR 127 (1959) 44–46.
Lau, D., Function algebras over finite sets (German) Dissertation, Wilhelm-Pieck-Universität Rostock, 1984, 214 pp.
Mal'cev, A.I., Iterative algebras and Post's varieties (Russian). Algebra i logika (Sem.) 5 (1966) No.2, pp. 5–24. English translation in The metamathematics of algebraic systems, Collected papers 1936–67. Studies in Logics and Fondations of Mathematics, vol. 66, North-Holland 1971.
Menger, K., Function algebra and propositional calculus. Self-organizing systems 1962. Washington: Spartan Books 1962.
Menger, K., On substitutive algebra and its syntax. Z. Math. Logik Grundl. Math. 10 (1964) 81–104.
Menger, K.; Whitlock, H.I., Two theorems on the generation of systems of functions. Fund.Math. 58 (1966) 229–240.
Rosenberg, I.G., Characterization of Mal'cev's preiterative algebra (prelim. announc.) Preprint CRM-594, Université de Montréal 1976, 15 pp.
Schweitzer, B.; Sklar, A., A mapping algebra with infinitely many operations. Colloq. Math. 9 (1962) 33–38.
Skala, H.L., Grouplike Menger Algebras. Fund. Math. 79 (1973) 199–207.
Trokhimenko, V.S., Ordered algebras of multiplace functions (Russian). Izv. Vyss Ucebn Zaved. Matematika 104 (1971), 90–98.
Trokhimenko, S.V., Characteristic of some algebras of functions of many-valued logic (Russian, English summary). Kibernetika Kiev 1987, no. 3, 63–67, 80, 135.
Whitlock, H.I., A composition algebra for multiplace functions. Math. Ann. 157 (1964) 167–178.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenberg, I.G. (1990). Mal'cev algebras for universal algebra terms. In: Bergman, C.H., Maddux, R.D., Pigozzi, D.L. (eds) Algebraic Logic and Universal Algebra in Computer Science. ALUACS 1988. Lecture Notes in Computer Science, vol 425. Springer, New York, NY. https://doi.org/10.1007/BFb0043085
Download citation
DOI: https://doi.org/10.1007/BFb0043085
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97288-6
Online ISBN: 978-0-387-34804-9
eBook Packages: Springer Book Archive