Skip to main content
SpringerLink
Log in

Representations in many-valued logics

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. U. Abdugaliev, “Normal forms of k-valued logic,” Kibernetika, no. 1, Kiev, 1967.

  2. N. N. Aizenberg and Z. L. Rabinovich, “Certain classes of functionally complete operations and canonical forms of representation of functions of many-valued logic,” Kibernetika, no. 2, Kiev, 1965.

  3. N. N. Aizenberg, “On the representation of a sum mod m in a class of normal forms of functions in m-valued logic,“ Kibernetika, no. 4, Kiev, 1965.

  4. R. A. Bairamov, “The interrelationship of precomplete classes of the algebra of logic and some of its consequences,” Diskretny i analiz, Novosibirsk, no. 5, 83–87, 1965.

    Google Scholar 

  5. R. A. Bairamov, “A series of precomplete classes in k-valued logic,” Kibernetika, no. 1, Kiev, 1967.

  6. I. N. Bogolyubov, “Problems in the synthesis of three-valued logical functions of several thresh-old elements” Avtomatika i vychislitel'naya tekhnika, no. 11, pp. 15–17, Riga, 1965.

    Google Scholar 

  7. I. N. Bogolyubov and V. I. Varshavskii, “On the representation of the function of ternary logic by disjunctive normal forms,” izd. AN SSSR, Tekhnicheskaya kibernetika, no. 6, Moscow, 1964.

  8. I. N. Bogolyubov and V. I. Varshavskii, “On the representation of the functions of ternary logic by disjunctive normal forms,” collection: Relay Devices, Finite Automata, and Coding [in Russian] Ontipribor, Moscow, pp. 13–14, 1964.

    Google Scholar 

  9. I. N. Bogolyubov and V. I. Varshavskii, “Ternary threshold elements and problems in their synthesis,” collection: The Synthesis of Relay Structures, izd-vo Nauka, Moscow, pp. 17–25, 1965.

    Google Scholar 

  10. I. N. Bogolyubov, B. L. Ovsievich, and L. Ya. Rozenblyum, “The synthesis of circuits from threshold and majority elements,” collection: Information Transmission Networks and their Automation [in Russian], izd-vo Nauka, Moscow, pp. 80–125, 1965.

    Google Scholar 

  11. V. G. Bodmarchuk, L. A. Kaluzhnin, V. N. Kotov, and B. A. Romov, “Galois theory for Post algebras,” Kibernetika, no. 3, Kiev, 1969.

  12. K. G. Borisov and L. L. Ytyakov, “Some possibilities for realizing functionally complete systems in frequency coding,” collection: Many-valued Elements and Structures [in Russian], Sovetskoe Radio, Moscow, pp. 93–96, 1967.

    Google Scholar 

  13. D. A. Bochvar, “A three-valued calculus,” Matem. Sb., Moscow, vol. 4, no. 2, pp. 287–308, 1938.

    Google Scholar 

  14. D. A. Bochvar, “The problem of consistency in a three-valued calculus,” Matem. Sb., Moscow, vol. 12, no. 54, pp. 353–369, 1943.

    Google Scholar 

  15. Wang Hsiang-hao, “Structure with completeness and partially defined functions in k-valued logic,” Kaoteng Hsüehhsiao Tsejan K'ohsüéh Hsüehpao, vol.2, no. 1, 1966.

  16. Yu. A. Vasilenko, “A complete system of functions,” collection: Many-Valued Elements and Structures [in Russian], Sovetskoe Radio, Moscow, pp. 97–98, 1957.

    Google Scholar 

  17. V. I. Varshavskii, “Three-valued majority logic,” Avtomatika i Telemekhanika, no. 5, Moscow, 1964.

  18. V. M. Glushkov, “Some problems in the synthesis of digital automata,” Zh. vychisl. matem. i matem. fizik, Moscow, vol.1, no. 3, pp. 371–411, 1961.

    Google Scholar 

  19. V. M. Glushkov, The Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow, 1962.

    Google Scholar 

  20. V. M. Gnidenko, Determination of the orders of precomplete classes in three-valued logic,” sb. Problemy Kibernetiki, Moscow, no. 8, pp. 341–346, 1962.

    Google Scholar 

  21. A. Yu. Gobzemis, “The construction of logical elements of NOR type,” Avtomatika i vychisl. tekh., Kiga, no. 2, pp. 149–154, 1965.

    Google Scholar 

  22. E. Yu. Zakharova, “A sufficient criterion for completeness in Pk,” sb. Problemy kibernetiki, Moscow, no. 16, pp. 239–244, 1960.

    Google Scholar 

  23. E. Yu. Zakharova, “Completeness criteria for systems of functions in Pk,” sb. Problemy kibernetiki, Moscow, no. 17, Moscow, pp. 5–10, 1967.

    Google Scholar 

  24. Yu. L. Ivas'kiv, “A three-valued algebra,” collection: Problems in the Theory of Computers [in Russian], izd-vo Naukova Dumka, Kiev, 1963.

    Google Scholar 

  25. Yu. L. Ivas'kiv, “A vector method of representing functions of a three-valued logic and its application to the synthesis of three-valued digital networks,” collection: Problems in the Theory of Computers [in Russian], izd-vo Naukova Dumka, Kiev, 1964.

    Google Scholar 

  26. Yu. L. Ivas'kiv, “On two classes of ternary algebras permitting the expansion of functions in an analog of disjunctive normal form,” collection: Problems in the Theory of Computers [in Russian], izd-vo Naukova Dumka, Kiev, 1965.

    Google Scholar 

  27. Yu. L. Ivas'kiv, “On a class of three-valued algebras and its application to the synthesis of ternary logical networks of ternary elements,” Kibernetika, no. 2, Kiev, 1965.

  28. B. M. Kloss and É. I. Nechiporuk, “A classification of functions in many-valued logic,” sb. Problemy kibernetiki, no. 9, pp. 27–36, 1963.

    Google Scholar 

  29. A. V. Kuznetsov, “Structure with closure and criteria for functional completeness” Usp. matem. nauk,16, no. 2 (98), pp. 201–202, 1961.

    Google Scholar 

  30. Lo Chu-k'al, “On the precompleteness of classes preserving division,” Chilin Taksueh, Tz'ujang K'ohsüéh Hsüepao, no. 2, 1963.

  31. Lo Chu-k'ai, “The precompleteness of a set and a ring of linear functions,” Chilin Taksueh, Tz'ujang K'ohsüéh Hsüepao, no. 2, 1963.

  32. Lo Chu-k'ai and Liu Hsü-hua, “Precomplete classes defined by binary relations in many-valued logic,” Chilin Taksueh, Tz'ujang K'ohsüéh Hsüepao, no. 4, 1963.

  33. Lo Chu-k'ai, “Precomplete classes defined by normal k-ary relations in k-valued logic,” Chilin Taksueh, Tz'ujang K'ohsüéh Hsüepao, no. 2, 1964.

  34. A. I. Mal'tsev, “A strengthening of a theorem of Slupecki and Yablonskii,” sb. Algebra i logika, vol.6, no. 3, pp. 61–75, Novosibirsk, 1967.

    Google Scholar 

  35. V. V. Martynyuk, “The investigation of certain classes of functions in many-valued logics,” sb. Problemy kibernetiki, no. 3, pp. 49–60, Moscow, 1960.

    Google Scholar 

  36. T. Miyamoto et al., “The investigation of three-valued ternary computational schemes,” Report no. 2, Kogakuin Daigaku Kenkyu Hokoku, no. 14, 1963.

  37. Gr. K. Moisil, The Algebraic Theory of Discrete Automatic Devices [Russian translation], IL, Moscow, 1963.

    Google Scholar 

  38. É. I. Nechkporuk, “On multiterminal networks realizing the functions of multivalued logic,” Problemy kibernetiki, no. 5, pp. 49–50, Moscow, 1961.

    Google Scholar 

  39. B. L. Ovsievich, “Some Properties of symmetric functions in ternary logic,” Problemy peredachi informatsii [Problems of Information Transmission], vol.1, no. 1, Moscow, 1965.

  40. B. L. Ovsievich, “The synthesis of circuits from three-values majority elements by the method of solving logical equations,”, Avtomatika i vychisl. tekhnika, no. 12, 143–154, Riga, 1966.

    Google Scholar 

  41. P'ang Yung chieh, “A decision procedure for determining all precomplete classes in manyvalued logic,” Chilin Taksueh Tz'ujang K'ohsüéh Hsüepao, no. 2, 1962.

  42. D. A. Pospelov, “The application of ternary logic to the analysis and synthesis of circuits,” Trudy MEI, Vychisl. tekhnika, no. 41, Moscow, 1962.

  43. D. A. Pospelov and V. N. Fal'k, “The realization of ternary functions using three-phase codes,” Izvestiya VUZ. Radiofizika, vol.5, no. 1 pp. 781–798, 1962.

    Google Scholar 

  44. D. A. Pospelov, Logical Methods for the Analysis and Synthesis of Circuits [in Russian], izd-vo Energiya, Moscow, 1964.

    Google Scholar 

  45. D. A. Pospelov and Zh. Toshich, “Polynomial representations in many-valued logics,” collection: Many-Valued Elements and Structures [in Russian], izd-vo Sovetskoe Radio, Moscow, 1967.

    Google Scholar 

  46. M. F. Ratsa, “A completeness criterion in a logic corresponding to the first Yablonskii matrix,” DAN SSSR, vol.168, no. 2, pp. 524–527, Moscow, 1966.

    Google Scholar 

  47. Z. L. Rabinovich and Yu. L. Ivas'kiv, “A class of canonical forms of representation for three-valued functions,” Izv. AN SSSR, Tekhnicheskaya kibernetika, no. 5, Moscow, 1963.

  48. V. L. Rvachev and L. I. Shklyarov, “Some functionally closed classes of functions in k-valued logic,” Kibernetika, no. 2, Kiev, 1967.

  49. A. M. Romankevich, “Problems in the minimization of many-valued functions in an extended algebra,” collection: Problems in the Theory of Computers [in Russian], no. 1, pp. 25–37, Kiev, 1966.

    Google Scholar 

  50. Zh. Toshich, “Polynomial representations in a class of three-valued logics,” Izv. AN SSSR, Tekhnicheskaya kibernetika, no. 2, Moscow, 1967.

  51. Zh. Toshich, “A polynomial representation in many-valued logics,” Trudy MEI, Moscow, 1967.

    Google Scholar 

  52. R. V. Freivald, “Completeness criteria for partial functions in the algebra of logic and many-valued logics,” DAN SSSR, vol.167, no. 6, pp. 1249–1250, Moscow, 1967.

    Google Scholar 

  53. Khen Tek Chen, “The existence and realization of invariant classes,” Choson minchuchup inmin Konkhvaguk Kvakhakvop Tkhonbo, no. 1, pp. 10–15, 1965.

    Google Scholar 

  54. V. I. Shestakov, “On some extensions of the calculi of Bochvar and Kleene to functionally complete three-valued calculi,” Nauchno-tekhnicheskaya informatsiya, ser. 2, Informatsionnye protsessy i sistemy, izd. VINITI, no. 12, Moscow, 1967.

  55. V. I. Shestakov, “On a binary arithmetical interpretation of a three-valued proposition calculus,” collection: The Application of Logic in Science and Technology [in Russian], izd-vo AN SSSR, Moscow, 1960.

    Google Scholar 

  56. G. A. Shestopal, “Simple bases in closed classes of functions in the algebra of logic,” DAN SSSR vol.168, no. 5, pp. 1023–1026, Moscow, 1967.

    Google Scholar 

  57. S. V. Yablonskii, “Functional completeness in three-valued calculus,” DAN SSSR, vol.95, no. 6, pp. 1153–1156, Moscow, 1954.

    Google Scholar 

  58. S. V. Yablonskii, “Functional constructions in k-valued logics,” Trudy MI AN SSSR, vol.51, pp. 5–142, Moscow, 1958.

    Google Scholar 

  59. S. V. Yablonskii, “The superposition of functions in Pk,” sb. Problemy kibernetiki, no. 9, pp. 337–340, Moscow, 1963.

    Google Scholar 

  60. Yu. I. Yanov and A. A. Muchnik, “The existence of k-valued closed classes without a finite basis,” DAN SSSR, vol.127, no. 1, pp. 44–46, Moscow, 1959.

    Google Scholar 

  61. W. Alexander, Ternary Algebra Electronic Power, vol.10, pp. 36–79, February 1964.

    Google Scholar 

  62. L. Djorjević, “Elementi troznacne logike” Automatika, vol.7, nos. 3,3, pp. 147–150, 1966.

    Google Scholar 

  63. L. Djorjević, “Algebraic solution of single variable ternary logic equations,” Zbornik radova Trećeg jugoslovenskog simposijma o digitalnoj technici i obradi podatka, Ljublana, 1967.

  64. M. I. Gazale, Les Structures de Communication a m-valeurs et les Calculatrices Numériques, Ganthier-Villars, Paris, 1959.

    Google Scholar 

  65. E. Götlind, “Some Sheffer functions in n-valued logic,” Portugaliae Mathematica, vol. 11, pp. 141–149, 1952.

    Google Scholar 

  66. W. H. Hanson, “Ternary threshold logic,” IEEE Trans. on Electronic Computers, vol. 12, no. 3, pp. 191–197, 1963.

    Google Scholar 

  67. W. H. Jobe, “Functional completeness and canonical forms in many-valued logics,” J. Symbolic Logic, vol.27, no. 4, pp. 409–422, 1962.

    Google Scholar 

  68. Y. A. Keir, “Algebraic properties of three-valued compositions,” IEEE Trans. on Electronic Computers, vol.13, no. 5, pp. 635–638, 1964.

    Google Scholar 

  69. V. Kirin, “On the intersection of precomplete sets in finite algebras,” Glasnik mat.-fiz. i astronom., vol.20, nos. 3, 4, pp. 189–193, 1965.

    Google Scholar 

  70. S. Kobayashi, “Note on many-valued logic,” Mem. Fac. Eng. Nagoya Univ., vol.12, no. 1, pp. 117–122, 1960.

    Google Scholar 

  71. C. Y. Lee and W. H. Chen, “Several-valued combinational switching circuits,” Electronics and Communications no. 26, pp. 278–282, 1956.

    Google Scholar 

  72. O. Lowenschuss, “Nonbinary switching theory,” IRE National Convention Record, pt. 4, pp. 305–317, 1958.

    Google Scholar 

  73. N. M. Martin, “A note on Sheffer functions in n-valued logic,” Methods, vol.3, pp. 240–241, 1951.

    Google Scholar 

  74. N. M. Martin, “Some analogs of the Sheffer stroke function in n-valued logic,” Indagationes Mathematicae, vol.12, pp. 393–400, 1950.

    Google Scholar 

  75. N. M. Martin “Sheffer functions and axiom sets in m-valued propositional logic,” Doctoral Dissertation, U.C.L.A., 1952.

  76. N. M. Martin, “The Sheffer functions of three-valued logic,” J. Symbolic Logic, vol.19, pp. 45–51 1954.

    Google Scholar 

  77. R. Merril, “Some properties of ternary threshold logic,” IEEE Trans. on Electronic Computers, vol.13, pp. 632–635, October 1964.

    Google Scholar 

  78. E. Mühldorf, “Many-valued switching algebras and their application in digital systems,” Proc. Nat. Electronics Conf., Chicago, vol. 15, pp. 467–480, 1960.

    Google Scholar 

  79. E. Mühldorf, “Ternäre Schaltalgebra,” Archiv. der Electr. Übertr., vol.12 pp. 138–148. March 1958.

    Google Scholar 

  80. S. Piccard, “Sur les definies dans les ensembles finis qualconques,” Fundamenta Mathematica, vol.24, pp. 183–185, 1935.

    Google Scholar 

  81. E. L. Post, “Introduction to the general theory of elementary propositions,” Amer. Math. Monthly, vol.43, no. 3, pp. 163–185, 1921.

    Google Scholar 

  82. I. Rosenberg, “Zu einigen Fragen der Superposition von Funktionen mehrerer Veränderlicher,” Bull. Inst. Politehn. Jasi, vol.12, nos. 1, 2, pp. 7–15, 1966.

    Google Scholar 

  83. I. Rosenberg, “La structure des fonctions de plusieurs valuers sur un ensemble fini,” C. R. Acad. Sci., Paris, vol.260, no. 14, Group 1, April 5, 1965.

  84. D. B.Rosser and A. R. Turque, Many-valued Logic, North Holland Publ. Co., 1952.

  85. Arto Salomaa, “On essential variables of functions, especially in the algebra of logic,” Suomalais tiedeakt toimituks, ser. A-no, 339, 1963.

  86. Arto Salomaa, “On the heights of closed sets of operations in finite algebras,” Suomalais tiedeakt toimituks, no. 365, 1965.

  87. Arto Salomaa, “On the number of simple bases for a set of functions over a finite domain,” Turun Yliopiston Julkaisnja, ser. A-1, no. 52 1962.

  88. Arto Salomaa, “Some completeness criteria for sets of functions over a finite domain, Pt. I,” Suomalais tiedeakt toimituks, no. 53, 1962; Pt. II, Suomalais tiedeakt toimituks, no. 63, 1963.

  89. I. Santos, et al., “Threshold synthesis of ternary digital systems,” IEEE Transactions on Electronic Computers, vol.15, no. 1, pp. 105–107, 1966.

    Google Scholar 

  90. P. Schofield, “Complete subsets of mappings over a finite domain,” Proc. Camb. Phil. Soc., vol.62, no. 4, pp. 597–611, 1966.

    Google Scholar 

  91. P. Schofield, “On a correspondence between many-valued and two-valued logics,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4, pp. 265–274, 1964.

    Google Scholar 

  92. J. Slupecki, Pelny troiwartosciowy rachunec Zdan., Comptes Rendus des séances de la société des sciences et des lettres de Varsovie, C1. 3, 23, 1930 (Sprawozdania\(\bar z\) posiedzen towarzystwa Náukowego Warszawskiego, Wydzial 3, Rok 23, 1930).

  93. J. Slupecki, Pelny troiwartosciowy rachunec Zdan., Sprawozdania\(\bar z\) posiedzen towarystwa Náukowego Warszawskiego, Wydzial 3, Rok 29, 1936.

  94. J. Slupecki, Kryterium pelnosci wielowartosciowych Systemow logiki Zdan., Sprawozdania\(\bar z\) posiedzen towary stwa Nákowego Warszawskiego, Wydzial 3, Rok 32, pp. 102–109, 1939.

  95. I. D. Swift, “Algebraic properties of N-valued propositional calculi,”, Amer. Math. Monthly, vol.59, No. 9, pp. 612–620, 1952.

    Google Scholar 

  96. E. Trevor and M. Lane, “Sheffer stroke functions in many-valued logic,” Portugaliae Mathematica, vol.16, nos. 3, 4, pp. 83–84, 1957.

    Google Scholar 

  97. R. Vacca, “A three-valued system of logic and its application to base three digital circuits,” Information Processing, 1960.

  98. V. Varshavskii and B. Ovsievich, “Networks composed of ternary majority circuits,” IEEE Trans. on Electronic Computers, vol.14, pp. 730–733, October 1966.

    Google Scholar 

  99. D. L. Webb, “Definition of Post's generalized negative and maximum in terms with one binary operation,” Amer. J. Mathematics, vol.58, pp. 193–194, 1936.

    Google Scholar 

  100. D. L. Webb “Generation of any n-valued logic by one binary operator,” Proc. Nat. Acad. Sci. USA, vol.21, no. 5, pp. 252–254, 1935.

    Google Scholar 

  101. M. Yoeli and G. Rosenfeld, “Logical design of ternary switching circuits,” IEEE Trans. on Electronic Computers, vol.14, no. 1, pp 19–29, 1965.

    Google Scholar 

  102. E. Zylinski, “Some remarks concerning the theory of deduction,” Fundamenta mathematica, vol.7, 1925.

Download references

Authors
  1. Yu. L. Ivas'kiv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. A. Pospelov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zh. Toshich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, Vol. 5, No. 2, pp. 35–47, March–April, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivas'kiv, Y.L., Pospelov, D.A. & Toshich, Z. Representations in many-valued logics. Cybern Syst Anal 5, 163–177 (1969). https://doi.org/10.1007/BF01071086

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071086

Keywords

Search

Navigation