Author:
Myasnikov A. G.,Remeslennikov V. N.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. K. J. Compton, “The computational complexity of asymptotic problems. I: Partial orders,” Inf. Comp., 78, No. 2, 108–123 (1988).
2. D. J. Kleitman and B. L. Rothschild, “Asymptotic enumeration of partial orders on a finite set,” Trans. Am. Math. Soc., 205, 205–220 (1975).
3. I. A. Lavrov, “Effective unseparability of the sets of identically true formulae and finitely refutable formulae for certain elementary theories,” Algebra Logika, 2, No. 1, 5–18 (1963).
4. R. H. Gilman, Y. Gurevich, and A. Miasnikov, “A geometric zero–one law,” J. Symb. Log., 74, No. 3, 929–938 (2009).
5. A. A. Mishchenko, V. N. Remeslennikov, and A. V. Treier, “Generic theories for series of finite Abelian groups,” Algebra and Logic, 53, No. 6, 471–480 (2014).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献