Skip to main content
Log in

Primitive program algebras. II

  • 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. V. N. Red'ko, “Imperative program logics. Basic results and known problems,” in: Abstracts of Papers at the 2nd All-Union Conf. on Computerized Production, Applied Program Packages, and Translators [in Russian], IK AN ESSR, Tallin (1983), pp. 109–111.

    Google Scholar 

  2. V. N. Red'ko, “Universal program logics and their application,” in: Proc. All-Union Symp. on Theoretical and System Programming [in Russian], Shtiintsa, Kishinev (1983), pp. 310–326.

    Google Scholar 

  3. D. B. Bui and V. N. Red'ko, “Primitive program algebras. I,” Kibernetika, No. 5, 1–7. (1984).

    Google Scholar 

  4. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  5. Yu. L. Ershov and E. A. Palyutin, Mathematical Logic [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  6. A. Aho and J. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

Download references

Authors

Additional information

Translated from Kibernetika, No. 1, pp. 28–33, January–February, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bui, D.B., Red'ko, V.N. Primitive program algebras. II. Cybern Syst Anal 21, 33–40 (1985). https://doi.org/10.1007/BF01075117

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation