Skip to main content
SpringerLink
Log in

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

  • Published:
Cybernetics and Systems Analysis 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

References

  1. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1978).

    Google Scholar 

  2. G. E. Tseitlin, An Introduction to Algorithmics [in Russian], Sfera, Kiev (1998).

    Google Scholar 

  3. L. A. Kaluzhnin, “On algorithmization of mathematical problems,” Probl. Kibern., No. 2, 51–69 (1959).

  4. V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–10 (1965).

  5. Yu. V. Golunkov, “Completeness of operations in systems of algorithmic algebras,” Algor. Avtomat., KazGU, 11–53, Kazan’ (1978).

  6. D. B. Bui and V. N. Red’ko, “Primitive program algebras of computable functions,” Kibernetika, No. 3, 68–74 (1987).

  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. G. E. Tseitlin, “Algebra of algorithmics and the properties of the structure of its subalgebras,” Dopov. NANU [in Ukrainian], No. 11, 11–14 (1995).

  9. G. E. Tseitlin, “Functional completeness criteria in Dijkstra algebra,” Kibern. Sist. Anal., No. 5, 28–39 (1995).

  10. G. E. Tseitlin, “Constructing the lattice of subalgebras of the Dijkstra algebra,” Kibern. Sist. Anal., No. 1, 27–45 (1997).

  11. G. E. Tseitlin, “Algebra of algorithmics and its applications,” Probl. Progr., No. 2, 7–15 (1997).

  12. G. E. Tseitlin, “Functional completeness in iterative meta-algebras,” Kibern. Syst. Anal., No. 2, 12–26 (1998).

  13. E. L. Post, “The two-terminal iterative systems of mathematical logic,” Ann. Math. Studies, 5, No. 5 (1941).

    Google Scholar 

  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. S. V. Yablonskii, “Functional constructions in it-valued logic,” Tr. MIAN USSR, No. 51, 5–142 (1958).

  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. G. E. Tseitlin, “Infinitely generated subalgebras of the modified Post algebra,” Kibernetika, No. 2, 43–45 (1971).

Download references

Authors
  1. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 13–24, May–June, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E. Criteria of functional completeness for meta-algebras without assignments of logical constants. Cybern Syst Anal 35, 354–362 (1999). https://doi.org/10.1007/BF02733423

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation