This is a preview of subscription content, log in via an institution to check access.
Literature cited
A. Aho, J. Hopcroft, and J. Ulman, Construction and Analysis of Computing Algorithms [Russian translation], Mir, Moscow (1979).
L. Rosenberg, “La structure des fonctions de plusieurs variables sur un ensemble fini,” C. R. Acad. Sci.,260, No. 14, 3817–3819 (1965).
S. V. Yablonskii, Introduction into Discrete Mathematics [in Russian], Nauka, Moscow (1979).
V. B. Alekseev and N. R. Emel'yanov, “A method of construction of fast algorithms in the k-valued logic,” Mat. Zametki,38, No. 1, 148–156 (1985).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 39, No. 5, pp. 766–775, May, 1986.
The author is grateful to V. B. Alekseev for stating the problem and for guidance.
Rights and permissions
About this article
Cite this article
Emel'yanov, N.R. One approach to construction of effective algorithms for recognizing completeness in multivalued logics. Mathematical Notes of the Academy of Sciences of the USSR 39, 418–423 (1986). https://doi.org/10.1007/BF01156684
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01156684