Voir la notice de l'article provenant de la source Math-Net.Ru
@article{SEMR_2008_5_a0, author = {V. G. Puzarenko}, title = {On collection of all computable subsets on admissible sets}, journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a}, pages = {1--7}, publisher = {mathdoc}, volume = {5}, year = {2008}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/SEMR_2008_5_a0/} }
V. G. Puzarenko. On collection of all computable subsets on admissible sets. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 5 (2008), pp. 1-7. http://geodesic.mathdoc.fr/item/SEMR_2008_5_a0/
[1] Muchnik A., “Solution of Post reduction problem and of certain other problems in theory of algorithms I”, Amer. Math. Soc. Transl. (2), 29 (1963), 197–215 | MR
[2] Odifreddi P., Classical recursion theory. The theory of functions and sets of natural numbers, Studies in Logic and the Foundations of Mathematics, 125, North-Holland, Amsterdam etc., 1989 | MR | Zbl
[3] Puzarenko V. G., “K vychislimosti na spetsialnykh modelyakh”, Sib. mat. zhurnal, 46:1 (2005), 185–208 | MR | Zbl
[4] Barwise J., Admissible Sets and Structures, Springer, 1975 | MR | Zbl
[5] Ershov Yu. L., Opredelimost i vychislimost, Nauchnaya kniga, Novosibirsk; Ekonomika, Moskva, 2000 | MR
[6] Morozov A. S., Puzarenko V. G., “O $\Sigma$-podmnozhestvakh naturalnykh chisel”, Algebra i logika, 43:3 (2004), 291–320 | MR | Zbl