Skip to main content
Log in

Questions of functional completeness for a modification of Boolean algebra

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. E. Post, Two-Valued Iterative Systems, 1941.

  2. S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Functions of Boolean Algebra and Post Classes [in Russian], Izd. Nauka, Moscow, 1966.

    Google Scholar 

  3. S. V. Yablonskii, “Functional constructions in k-valued logic,” Trudy Matematicheskogo in-ta im. V. A. Steklova, vol. 51, Izd. AN SSSR, 5–142, 1958.

    Google Scholar 

  4. Yu. I. Yanov and A. A. Muchnik, “The existence of k-valued closed classes which do not have a finite basis,” DAN SSSR,127, 44–46, 1959.

    Google Scholar 

  5. A. Salomaa, “On the composition on functions of several variables ranging over a finite set,” Turun Yliopiston Julkaisuja Annales Universitatis Turkuensis, sarja, Series A. I,41, 1–48, 1960.

    Google Scholar 

  6. A. I. Mal'tsev, “Iterative algebras and Post manifolds,” collection: Algebra and Logic [in Russian], vol. 5, no. 2, Novosibirsk, 1966.

  7. V. M. Glushkov, “Automata theory and structural design problems of digital machines,” Kibernetika [Cybernetics], no. 1, Kiev, 1965.

  8. A. G. Kurosh, Lectures on General Algebra [in Russian], Moscow, 1962.

  9. V. G. Bodnarchuk and G. E. Tseitlin, “On algebras of periodically defined transformations of an infinite register,” Kibernetika, no. 1, Kiev, 1969.

  10. G. E. Tseitlin, “Completeness problems in algebras of Boolean functions,” Kibernetika, no. 3, Kiev, 1968.

Download references

Authors

Additional information

Institute of Cybernetics, AS UkrSSR, Kiev. Translated from Kibernetika, Vol. 5, No. 4, pp. 39–44, July–August, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E. Questions of functional completeness for a modification of Boolean algebra. Cybern Syst Anal 5, 400–407 (1969). https://doi.org/10.1007/BF01073051

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation