Cybernetics and Systems Analysis

, Volume 35, Issue 3, pp 354–362 | Cite as

Criteria of functional completeness for meta-algebras without assignments of logical constants

  • G. E. Tseitlin


Boolean Function Free Variable Logical Constant Logical Component Functional Completeness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1978).Google Scholar
  2. 2.
    G. E. Tseitlin, An Introduction to Algorithmics [in Russian], Sfera, Kiev (1998).Google Scholar
  3. 3.
    L. A. Kaluzhnin, “On algorithmization of mathematical problems,” Probl. Kibern., No. 2, 51–69 (1959).Google Scholar
  4. 4.
    V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–10 (1965).Google Scholar
  5. 5.
    Yu. V. Golunkov, “Completeness of operations in systems of algorithmic algebras,” Algor. Avtomat., KazGU, 11–53, Kazan’ (1978).Google Scholar
  6. 6.
    D. B. Bui and V. N. Red’ko, “Primitive program algebras of computable functions,” Kibernetika, No. 3, 68–74 (1987).Google Scholar
  7. 7.
    V. D. Solov’yev, “Functional systems of recursive functions and predicates with strong software of closure,” Synopsis of Doctoral Thesis in Physical and Mathematical Sciences [in Russian], MGU, Moscow (1996).Google Scholar
  8. 8.
    G. E. Tseitlin, “Algebra of algorithmics and the properties of the structure of its subalgebras,” Dopov. NANU [in Ukrainian], No. 11, 11–14 (1995).Google Scholar
  9. 9.
    G. E. Tseitlin, “Functional completeness criteria in Dijkstra algebra,” Kibern. Sist. Anal., No. 5, 28–39 (1995).Google Scholar
  10. 10.
    G. E. Tseitlin, “Constructing the lattice of subalgebras of the Dijkstra algebra,” Kibern. Sist. Anal., No. 1, 27–45 (1997).Google Scholar
  11. 11.
    G. E. Tseitlin, “Algebra of algorithmics and its applications,” Probl. Progr., No. 2, 7–15 (1997).Google Scholar
  12. 12.
    G. E. Tseitlin, “Functional completeness in iterative meta-algebras,” Kibern. Syst. Anal., No. 2, 12–26 (1998).Google Scholar
  13. 13.
    E. L. Post, “The two-terminal iterative systems of mathematical logic,” Ann. Math. Studies, 5, No. 5 (1941).Google Scholar
  14. 14.
    S. V. Yablonskii, G. P. Gavrilov, and B. V. Kudryavtsev, Functions of Algebra of Logic and Post Classes [in Russian], Nauka, Moscow (1966).Google Scholar
  15. 15.
    S. V. Yablonskii, “Functional constructions in it-valued logic,” Tr. MIAN USSR, No. 51, 5–142 (1958).Google Scholar
  16. 16.
    A. I. Mal’tsev, “Iterative algebras and Post varieties,” in: Izbr. Tr. A. I. Mal’tseva, V. 2 (1976), pp. 316–330.Google Scholar
  17. 17.
    G. E. Tseitlin, “Infinitely generated subalgebras of the modified Post algebra,” Kibernetika, No. 2, 43–45 (1971).Google Scholar

Copyright information

© Kluwer Academic/Plenum Publishers 1999

Authors and Affiliations

  • G. E. Tseitlin

There are no affiliations available

Personalised recommendations