Literature Cited
John G. Kemeny, “A logical measure function,” Journal of the Symbolic Logic,18, no. 4, 1953.
R. W. Ritchie, “Classes of predictably computable functions,” Trans. Amer. Math. Soc.,106, 1, 1963.
A. Church, Introduction to Mathematical Logic, Vol. 1 [Russian translation] IL, Moscow, 1960.
B. A. Trakhtenbrot, Impossibility of an Algorithm for the Decision Problem on Finite Classes, DAN SSSR, 70, 1950.
J. Riordan, Introduction to Combinational Analysis [Russian translation], IL, Moscow, 1963.
L. Wittgenstein, Tractatus Logico-Philosophicus [Russian translation], Moscow, 1958.
K. Jaakko and K. I. Hintikka, “Identity, variables, and impredicative definitions,” Journal of the Symbolic Logic,21, 1956.
Additional information
Translated from Kibernetika, Vol. 5, No. 2, pp. 17–27, March–April, 1969.
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071084