Skip to main content
SpringerLink
Log in

Examples of predicates inexpressible by s-rudimentary formulas

  • Published:
Cybernetics 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. R. M. Smullyan, Theory of Formal Systems, Princeton University Press, Princeton (1963).

    Google Scholar 

  2. N. D. Jones, Computability Theory. An Introduction, Academic Press, New York (1973).

    Google Scholar 

  3. N. K. Kosovskii, “Certain properties of solutions of equations in a free semigroup,” in: Investigations on Constructive Mathematics and Mathematical Log. V [in Russian], Zap. Nauchn. Seminarov Leningradsk. Otdel. Mat. Inst. im. V. A. Steklova Akad. Nauk SSSR, Vol. 32, Leningrad (1972), pp. 21–28.

  4. V. A. Nepomnyashchii, “Rudimentary predicates and Turing computations,” Dokl. Akad. Nauk SSSR,195, No. 2 (1970).

Download references

Authors
  1. V. A. Nepomnyashchii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 44–46, March–April, 1978

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nepomnyashchii, V.A. Examples of predicates inexpressible by s-rudimentary formulas. Cybern Syst Anal 14, 198–200 (1978). https://doi.org/10.1007/BF01069350

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation