Literature Cited
E. Post, Two-Valued Iterative Systems, 1941.
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Functions of Boolean Algebra and Post Classes [in Russian], Izd. Nauka, Moscow, 1966.
S. V. Yablonskii, “Functional constructions in k-valued logic,” Trudy Matematicheskogo in-ta im. V. A. Steklova, vol. 51, Izd. AN SSSR, 5–142, 1958.
Yu. I. Yanov and A. A. Muchnik, “The existence of k-valued closed classes which do not have a finite basis,” DAN SSSR,127, 44–46, 1959.
A. Salomaa, “On the composition on functions of several variables ranging over a finite set,” Turun Yliopiston Julkaisuja Annales Universitatis Turkuensis, sarja, Series A. I,41, 1–48, 1960.
A. I. Mal'tsev, “Iterative algebras and Post manifolds,” collection: Algebra and Logic [in Russian], vol. 5, no. 2, Novosibirsk, 1966.
V. M. Glushkov, “Automata theory and structural design problems of digital machines,” Kibernetika [Cybernetics], no. 1, Kiev, 1965.
A. G. Kurosh, Lectures on General Algebra [in Russian], Moscow, 1962.
V. G. Bodnarchuk and G. E. Tseitlin, “On algebras of periodically defined transformations of an infinite register,” Kibernetika, no. 1, Kiev, 1969.
G. E. Tseitlin, “Completeness problems in algebras of Boolean functions,” Kibernetika, no. 3, Kiev, 1968.
Additional information
Institute of Cybernetics, AS UkrSSR, Kiev. Translated from Kibernetika, Vol. 5, No. 4, pp. 39–44, July–August, 1969.
Rights and permissions
About this article
Cite this article
Tseitlin, G.E. Questions of functional completeness for a modification of Boolean algebra. Cybern Syst Anal 5, 400–407 (1969). https://doi.org/10.1007/BF01073051
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01073051