Skip to main content
SpringerLink
Log in

A method for constructing maximal subalgebras of algebras of general recursive functions

  • Published:
Algebra and Logic 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. S. A. Berezin, "An algebra of one-place primitive recursive functions with iteration operation of general form," Kibernetika, No. 3, 12–19 (1976).

    Google Scholar 

  2. G. P. Gavrilov, "Functional completeness in a countably valued logic," in: Problems of Cybernetics [in Russian], No. 15 (1965), pp. 5–64.

    Google Scholar 

  3. D. A. Zakharov, Recursive Functions [in Russian], Novosibirsk (1970).

  4. V. V. Koz'minykh, "One-place primitive recursive functions," Algebra Logika,7, 75–90 (1968).

    Google Scholar 

  5. A. I. Mal'tsev, "Iterative algebras and Post varieties," Algebra Logika,5, 5–24 (1966).

    Google Scholar 

  6. A. I. Mal'tsev, "Constructive algebras. I," Usp. Mat. Nauk,16, No. 3, 3–60 (1961).

    Google Scholar 

  7. S. S. Marchenkov, "Bounded recursions," Math. Balkanica,2, 124–142 (1972).

    Google Scholar 

  8. S. S. Marchenkov, "Elimination of recursion schemes in the Grzegorczyk class," Mat. Zametki,5, No. 5, 561–568 (1969).

    Google Scholar 

  9. V. L. Mikheev, "A class of algebras of primitive recursive functions," Mat. Zametki,14, No. 1 143–156 (1973).

    Google Scholar 

  10. S. V. Pakhomov, "A simple syntactical definition of all classes of the Grzegorczyk hierarchy," Zap. Nauch. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,40, 127–130 (1974).

    Google Scholar 

  11. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  12. M. G. Rozinas, "An algebra of many-place primitive recursive functions," Uch. Zap. Ivanovsk. Gos. Pedagog. Inst.,117, 95–111 (1972).

    Google Scholar 

  13. A. Cobham, "The intrinsic computational difficulty of functions," in: Logic, Methodology and Philosophy of Science, Amsterdam (1965), pp. 24–30.

  14. A. Grzegorczyk, "Some classes of recursive functions," in: Rozprawy Matematiczne, Vol. 4, Warsaw (1953).

  15. R. W. Ritchie, "Classes of predictably computable functions," Trans. Am. Math. Soc.,106, 139–173 (1963).

    Google Scholar 

Download references

Authors
  1. S. S. Marchenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 17, No. 5, pp. 581–595, September–October, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marchenkov, S.S. A method for constructing maximal subalgebras of algebras of general recursive functions. Algebra and Logic 17, 383–392 (1978). https://doi.org/10.1007/BF01673826

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation