Skip to main content
SpringerLink
Log in

Range and degree of realizability of formulas in the restricted predicate calculus

  • 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. John G. Kemeny, “A logical measure function,” Journal of the Symbolic Logic,18, no. 4, 1953.

  2. R. W. Ritchie, “Classes of predictably computable functions,” Trans. Amer. Math. Soc.,106, 1, 1963.

    Google Scholar 

  3. A. Church, Introduction to Mathematical Logic, Vol. 1 [Russian translation] IL, Moscow, 1960.

    Google Scholar 

  4. B. A. Trakhtenbrot, Impossibility of an Algorithm for the Decision Problem on Finite Classes, DAN SSSR, 70, 1950.

  5. J. Riordan, Introduction to Combinational Analysis [Russian translation], IL, Moscow, 1963.

    Google Scholar 

  6. L. Wittgenstein, Tractatus Logico-Philosophicus [Russian translation], Moscow, 1958.

  7. K. Jaakko and K. I. Hintikka, “Identity, variables, and impredicative definitions,” Journal of the Symbolic Logic,21, 1956.

Download references

Authors
  1. Yu. V. Glebskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. I. Kogan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. I. Liogon'kii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. A. Talanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, Vol. 5, No. 2, pp. 17–27, March–April, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glebskii, Y.V., Kogan, D.I., Liogon'kii, M.I. et al. Range and degree of realizability of formulas in the restricted predicate calculus. Cybern Syst Anal 5, 142–154 (1969). https://doi.org/10.1007/BF01071084

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation