Literature Cited
V. M. Glushkov, “Automata theory and structural design problems of digital machines,” Kibernetika, No. 1 (1965).
E. Post, Two-Valued Iterative Systems, Krauss Reprint Co. (1941).
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Functions of the Algebra of Logic and Post Classes [in Russian], Nauka, Moscow (1966).
S. V. Yablonskii, “Functional constructions in k-valued logic,” Tr. Matem. Inst. im. V. A. Steklova, Izd. Akad. Nauk SSSR,51 (1958).
Yu. I. Yanov and A. A. Muchnik, “On the existence of k-valued closed classes having no finite basis,” Dokl. Akad. Nauk SSSR,127 (1959).
G. P. Gavrilov, “Functional completeness in a countably valued logic,” in: Problems of Cybernetics [in Russian], Vol. 15, Nauka, Moscow (1965).
B. H. Neumann, “Some remarks on infinite groups,” J. London Math. Soc.,12, 120–127 (1937).
P. M. Cohn, Universal Algebra, Harper and Row, New York (1968).
G. E. Tseitlin, “The structure of a modified Post algebra and its properties,” Kibernetika, No.4 (1970).
G. E. Tseitlin, “Infinitely generated subalgebras of a modified Post algebra,” Kibernetika, No. 2 (1971).
Additional information
Translated from Kibernetika, No. 3, pp. 46–51, May–June, 1974.
Rights and permissions
About this article
Cite this article
Tseitlin, G.E. Infinite generation criteria in universal algebras. Cybern Syst Anal 10, 427–433 (1974). https://doi.org/10.1007/BF01068710
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068710