Literature Cited
A. I. Mal'tsev, “Iterative Post algebras and varieties,” Algebra i Logika,5, No. 2 (1966).
A. Salomaa, “On basic groups for the set of functions over a finite domain,” Ann. Acad. Sci. Fennicae, Ser. A1 (1963).
J. Slupecki, “Kryterium pelności wielowartościowych systemów logikizdan,” Compt. Rend. Seanses Soc. Sic. (Warsaw), C1. III,32 (1939).
S. V. Yablonskii, “Functional structures in k-valued logic,” Trudy Matem. Inst. im. V. A. Steklova,51 (1958).
A. Salomaa, “A theorem concerning the composition of functions of several variables ranging over a finite domain,” J. Symbolic Logic,25 (1960).
E. Yu. Zakharova, “Completeness criterion for systems of functions in Pk,” in: Cybernetic Problems [in Russian], No. 18, Moscow (1967).
R. A. Bairamov, “The completeness problem for a symmetric semigroup of finite degree,” Discrete Analysis [in Russian], No. 8, Novosibirsk (1966).
A. Salomaa, “Some completeness criteria for the set of functions over a finite domain,” Ann. Univ. Turkuensis, Ser. A1,53 (1962).
A. I. Mal'tsev, “A strengthening of the theorems of Slupecki and Yablonskii,” Albegra i Logika,6, No. 3 (1967).
I. Rosenberg, “La structure des fonctions de plusiers variables sur un ensemble fini,” Compt. Rend.,260 (1965).
V. G. Bondarchuk, L. A. Kaluzhnin, V. N. Kotov, and B. A. Romov, “Galois theory for Post algebras,” Kibernetika, No. 3, 5 (1969).
Additional information
Translated from Kibernetika, No. 3, pp. 71–76, May–June, 1972.
Rights and permissions
About this article
Cite this article
Bairamov, R.A. Derivation of basicity criteria for permutation groups and transformation semigroups from a theorem of Rosenberg. Cybern Syst Anal 8, 427–433 (1972). https://doi.org/10.1007/BF01068997
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068997