This is a preview of subscription content, log in via an institution to check access.
Literature Cited
E. Post, “Introduction to a general theory of elementary propositions,” Am. J. Math.,43 (1921).
S. V. Yablonskii, “Functional constructions in k-valued logic,” Tr. Steklov Mat. Inst. Akad. Nauk SSSR,51 (1958).
I. Rosenberg, “Über die funktionale Vollständigkeit in den mehrwertigen Logiken,” Rozpravy Ceskoslovenske Akademie Ved.,80, 4 Praha (1970).
R.-M. V. Freivald, “Functional completeness for logic algebra functionsnot defined everywhere,” in Discrete Analysis [in Russian], No. 8, Novosibirsk (1966).
B. A. Romov, “On the formulability of predicates in a finite model,” Kibernetika, Kiev, No. 1 (1971).
V. G. Bodnarchuk, L. A. Kaluzhnin, V. N. Kotov, and B. A. Romov, “Galois theory for Post algebras I, II,” Kibernetika, Kiev, Nos. 3, 5 (1969).
G. A. Burle, “Classes of k-valued logic containing all functions of one variable,” in: Discrete Analysis [in Russian], No. 10, Novosibirsk (1967).
J. C. Muzio, “Some large classes of n-valued functions,” Proc. Cambr. Phil. Soc.,74, (1973).
I. Rosenberg, “Completeness properties of multiple-valued logic algebras,” in: Computer Science and Multiple-Valued Logic. Theory and Applications, North-Holland (1977).
T. Higuchi and M. Kameyama, “Static-hazard-free T-gate for ternary memory element and its application to ternary counters,” Proc. VI Int. Symp. Multiple-Valued Logic, Ithaca, New York (1976).
N. N. Aizenberg and Yu. L. Ivas'kiv, Multivalued Threshold Logic [in Russian], Naukova Dumka, Kiev (1977).
Additional information
Translated from Kibernetika, No. 1, pp. 28–36, January–February, 1980.
Rights and permissions
About this article
Cite this article
Romov, B.A. Maximal subalgebras of algebras of partial multivalued logic functions. Cybern Syst Anal 16, 31–41 (1980). https://doi.org/10.1007/BF01099358
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01099358