1. P. E. Alaev, “Structures computable in polynomial time. I,” Algebra i logika
55, 647 (2016) [Algebra and Logic 55, 421 (2017)].
2. P. E. Alaev and V. L. Selivanov, “Polynomial computability of fields of
algebraic numbers,” Dokl. Ross. Akad. Nauk 481,
355 (2018) [Dokl. Math. 98, 341
(2018)].
3. Yu. L. Ershov, Definability and
Computability (Nauchnaya Kniga, Novosibisrk, 1996; Consultants Bureau, New York,
1996).
4. Yu. L. Ershov, S. S. Goncharov, and D. I. Sviridenko, “Semantic
programming,” Inform. Process. Proc. IFIP
$$10
$$th World Computer
Congress, 1113 (North Holland, Amsterdam, 1986).
5. Yu. L. Ershov and E. A. Palyutin, Mathematical
Logic (Nauka, Moscow, 1987) [in Russian].