Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference33 articles.
1. Alaev, P.: Atomless boolean algebras computable in polynomial time. Sib. Electron. Mat. Izv. 13, 1035–1039 (2016)
2. Alaev, P.: Existence and uniqueness of structures computable in polynomial time. Algebra Log. 55, 72–76 (2016)
3. Alaev, P.: Structures computable in polynomial time one. Algebra Log. 55, 421–435 (2016)
4. Alaev, P.: Structures computable in polynomial time two. Algebra Log. 56, 429–442 (2017)
5. Alaev, P.: Categoricity for primitively recursive and polynomial boolean algebras. Algebra Log. 57, 251–274 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献