Primitive Recursive Fields and Categoricity
暂无分享,去创建一个
[1] Victor L. Selivanov,et al. Polynomial-Time Presentations of Algebraic Number Fields , 2018, CiE.
[2] On the representation of partial recursive functions as superpositions , 1972 .
[3] Keng Meng Ng,et al. Algebraic structures computable without delay , 2017, Theor. Comput. Sci..
[4] P. E. Alaev,et al. Structures Computable in Polynomial Time. I , 2017 .
[5] Alexandra Shlapentokh,et al. A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS , 2015, The Journal of Symbolic Logic.
[6] A. G. Melnikov,et al. The Diversity of Categoricity Without Delay , 2017 .
[7] P. E. Alaev,et al. Structures Computable in Polynomial Time. II , 2018 .
[8] P. E. Alaev. Categoricity for Primitive Recursive and Polynomial Boolean Algebras , 2018, Algebra and Logic.