References
R. Miller, B. Poonen, H. Schoutens, and A. Shlapentokh, “A computable functor from graphs to fields,” J. Symb. Log., 83, No. 1, 326-348 (2018).
P. E. Alaev, “Structures computable in polynomial time. I,” Algebra and Logic, 55, No. 6, 421-435 (2016).
P. E. Alaev, “Structures computable in polynomial time. II,” Algebra and Logic, 56, No. 6, 429-442 (2017).
P. E. Alaev, “Categoricity for primitive recursive and polynomial Boolean algebras,” Algebra and Logic, 57, No. 4, 251-274 (2018).
P. Alaev and V. Selivanov, “Polynomial-time presentations of algebraic number fields,” in Lect. Notes Comput. Sci., 10936, Springer, Cham (2018), pp. 20-29.
I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017).
I. Kalimullin, A. Melnikov A., and K. M. Ng, “The diversity of categoricity without delay,” Algebra and Logic, 56, No. 2, 171-177 (2017).
A. Frolov, I. Kalimullin, and R. Miller, “Spectra of algebraic fields and subfields,” in Lect. Notes Comput. Sci., 5635, Springer-Verlag, Berlin (2009), pp. 232-241.
V. V. Koz’minykh, “On the representation of partial recursive functions as superpositions,” Algebra and Logic, 11, No. 3, 153-167 (1972).
H. M. Edwards, Galois Theory, Grad. Texts Math., 101, Springer-Verlag, New York (1984).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 58, No. 1, pp. 132-138, January-February, 2019.
Rights and permissions
About this article
Cite this article
Kalimullin, I.S., Miller, R. Primitive Recursive Fields and Categoricity. Algebra Logic 58, 95–99 (2019). https://doi.org/10.1007/s10469-019-09527-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-019-09527-1