Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-25T15:23:26.122Z Has data issue: false hasContentIssue false

Ronald Fagin. Probabilities on finite models. The journal of symbolic logic, vol. 41 (1976), pp. 50–58. - Ú. V. Glébskij, D. I. Kogan, M. I. Liongon'kij, and V. A. Talanov. Obém i dolá vypolnimosti formul uzkogo isčisléniá prédikatov. Kibérnétika (Kiev), no. 2 (1969), pp. 17–27. - Yu. V. Glebskii, D. I. Kogan, M. I. Liogon′kii, and V. A. Talanov. Range and degree of realizability of formulas in the restricted predicate calculus. English translation of the preceding. Cybernetics (New York), vol. 5 (for 1969, pub. 1972), pp. 142–154. - James F. Lynch. Almost sure theories. Annals of mathematical logic, vol. 18 (1980), pp. 91–135. - V. L. Murskij. Konéčnaá baziruémost′ toždéstv i drugié svojstva “počti vséh” konéčnyh algébr (A finite basis of identities and other properties of “almost all” finite algebras). Problémy kibérnétiki, vol. 30 (1975), pp. 43–56. - Roy O. Davies. On n-valued Shejfer functions. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, vol. 25 (1979), pp. 293–298.

Review products

Ronald Fagin. Probabilities on finite models. The journal of symbolic logic, vol. 41 (1976), pp. 50–58.

Ú. V. Glébskij, D. I. Kogan, M. I. Liongon'kij, and V. A. Talanov. Obém i dolá vypolnimosti formul uzkogo isčisléniá prédikatov. Kibérnétika (Kiev), no. 2 (1969), pp. 17–27.

Yu. V. Glebskii, D. I. Kogan, M. I. Liogon′kii, and V. A. Talanov. Range and degree of realizability of formulas in the restricted predicate calculus. English translation of the preceding. Cybernetics (New York), vol. 5 (for 1969, pub. 1972), pp. 142–154.

Published online by Cambridge University Press:  12 March 2014

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Association for Symbolic Logic 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)