References
V. G. Puzarenko, “Computability in special models,” Sib. Math. J., 46, No. 1, 148-165 (2005).
Yu. L. Ershov, “Σ-definability in admissible sets,” Dokl. Akad. Nauk SSSR, 285, No. 4, 792-795 (1985).
Yu. L. Ershov, Definability and Computability, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1996).
Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).
S. S. Goncharov and Yu. L. Ershov, Constructive Models, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1999).
V. G. Puzarenko, “A certain reducibility on admissible sets,” Sib. Math. J., 50, No. 2, 330-340 (2009).
R. R. Avdeev, “On the admissible sets of type ℍ𝕐ℙ(𝔐) over recursively saturated models,” Sib. Math. J., 52, No. 6, 951-968 (2011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 56, No. 5, pp. 636-638, September-October, 2017.
∗Supported by RFBR, project No. 15-01-05114, and by the Grants Council (under RF President) for State Aid of Leading Scientific Schools, grant NSh-6848.2016.1.
Rights and permissions
About this article
Cite this article
Avdeev, R.R., Puzarenko, V.G. A Computable Structure with Nonstandard Computability. Algebra Logic 56, 425–426 (2017). https://doi.org/10.1007/s10469-017-9463-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-017-9463-4