Author:
Melnikov Alexander G.,Ng Keng Meng
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. C. Ash and J. Knight, Computable Structures and the Hyper arithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, Vol. 144, North-Holland, Amsterdam, 2000.
2. P. E. Alaev, Atomless Boolean algebras computable in polynomial time, Sibirskie Elektronnye Matematicheskie Izvestiya 13 (2016), 1035–1039.
3. P. E. Alaev, Existence and uniqueness of structures computable in polynomial time, Algebra and Logic 55 (2016), 72–76.
4. G. Braun and L. Strüngmann, Breaking up finite automata presentable torsionfree abelian groups, International Journal of Algebra and Computation 21 (2011), 1463–1472.
5. D. Cenzer, Downey, Remmel and Z. Uddin, Space complexity of abelian groups, Archive for Mathematical Logic 48 (2009), 115–140.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献