References
K. J.Compton, C. W.Henson and S.Shelah,Nonconvergence, undecidability, and intractability is asymptotic problems, Annals Pure Appl. Logic36 (????), 207–224.
R. Fagin,Probabilities of finite models, J. Symbolic Logic41 (1976), 50–58.
R. Fagin,The number of finite relational structures, Discrete Math.19 (1977), 17–21.
M. I. Liogon'kii,On the question of quantitative characteristics of logical formulas, (Russian), J. Symbolic Logic3 (1970), 16–22.
J. F. Lynch,Probabilities of first-order sentences about unary functions, Trans. Amer. Math. Soc.287 (1986), 543–568.
V. L. Murskii,The existence of a finite basis and some other properties of “almost all” finite algebras, (Russian), Problemy Kibernet30 (1979), 43–56.
V. L. Murskii,On the number of k-element algebras with one binary operation without a finite basis of identities, (Russian), Problemy Kibernet35 (1979), 5–27.
V. L. Murskii,On the fraction of closed classes without a finite basis of identities, Soviet Math. Dokl.35 (1987), 407–410.
G. Polya,Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbingungen, Acta. Math.68 (1937), 145–254.
W. Taylor,A review of [6]and other papers on probability in algebra and relational structures, J. Symbolic Logic50 (1985), 1073–1076.
Author information
Authors and Affiliations
Additional information
In Memory of Evelyn Nelson
This research was partially supported by NSF grant no. DMS-8521710.
Rights and permissions
About this article
Cite this article
Freese, R. On the two kinds of probability in algebra. Algebra Universalis 27, 70–79 (1990). https://doi.org/10.1007/BF01190254
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01190254