Voir la notice de l'article provenant de la source Math-Net.Ru
[1] K. J. Compton, “The computational complexity of asymptotic problems. I: Partial orders”, Inf. Comput., 78:2 (1988), 108–123 | DOI | MR | Zbl
[2] D. J. Kleitman, B. L. Rothschild, “Asymptotic enumeration of partial orders on a finite set”, Trans. Am. Math. Soc., 205 (1975), 205–220 | DOI | MR | Zbl
[3] I. A. Lavrov, “Effektivnaya neotdelimost mnozhestva tozhdestvenno istinnykh i mnozhestva konechno oproverzhimykh formul nekotorykh elementarnykh teorii”, Algebra i logika, 2:1 (1963), 5–18 | MR | Zbl
[4] R. H. Gilman, Y. Gurevich, A. Miasnikov, “A geometric zero-one law”, J. Symb. Log., 74:3 (2009), 929–938 | DOI | MR | Zbl
[5] A. A. Mischenko, V. N. Remeslennikov, A. V. Treier, “Genericheskie teorii serii konechnykh abelevykh grupp”, Algebra i logika, 53:6 (2014), 722–734
[6] A. Macintyre, “Model completeness”, Handbook of mathematical logic, ed. J. Barwise, North-Holland Publ. Co., Amsterdam, 1977, 80–139 | MR
[7] J. Ax, “The elementary theory of finite fields”, Ann. math., 88:2 (1968), 239–271 | DOI | MR | Zbl
[8] A. A. Mischenko, V. N. Remeslennikov, A. V. Treier, Klassifikatsiya universalnykh teorii abelevykh grupp, Preprint