This is a preview of subscription content, log in via an institution to check access.
Literature Cited
G. A. Shestopal, “Number of simple bases of Boolean functions,” Dokl. Akad. Nauk SSSR,140, No. 2 (1961).
G. A. Shestopal, “Simple bases in closed classes of logic-algebraic functions,” Dokl. Akad. Nauk SSSR,168, No. 5 (1966).
A. Salomaa, “On the number of simple bases of the set of functions over a finite domain,” Turun Yliopiston Julkaisuja, Sarja-Series Al, No. 52 (1962).
S. V. Yablonskii, “Superpositions of functions in Pk,” in: Problems of Cybernetics [in Russian], No. 9, Moscow (1963).
E. Yu. Zakharova and S. V. Yablonskii, “Some properties of essential functions in Pk,” in: Problems of Cybernetics [in Russian], No. 12, Moscow (1964).
V. B. Alekseev, “Simple bases in a k-valued logic,” Matem. Zametki,5, No. 4 (1969).
S. V. Yablonskii, “Functional constructions in a k-valued logic,” Trudy Matem. Inst. Steklov.,51, (1958).
V. V. Martynyuk, “Investigation of certain classes of functions in multivalued logics,” in: Problems of Cybernetics [in Russian], No. 3, Moscow (1960).
I. Rosenberg, “La structure des fonctions de plusieurs variables sur un ensemble fini,” Compt. Rend.,260 (1965).
Lo Chzhu-kai, “Precomplete classes defined by normal k-nary relations in a k-valued logic” [in Russian], Acta Scient. Natural., Univ. Jilinensis, No. 3, (1964).
E. Yu. Zakharova, “A completeness criterion for systems of functions in Pk,” in: Problems of Cybernetics [in Russian], No. 18, Moscow (1967).
Additional information
Moscow State University. Translated from Kibernetika, No. 5, pp. 137–141, September–October, 1971.
Rights and permissions
About this article
Cite this article
Alekseev, V.B. Simple bases and simple functions in a k-valued logic. Cybern Syst Anal 7, 920–925 (1971). https://doi.org/10.1007/BF01641514
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01641514