Sibirskie èlektronnye matematičeskie izvestiâ, Tome 5 (2008), pp. 1-7
Citer cet article
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/
@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},
year = {2008},
volume = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SEMR_2008_5_a0/}
}
TY - JOUR
AU - V. G. Puzarenko
TI - On collection of all computable subsets on admissible sets
JO - Sibirskie èlektronnye matematičeskie izvestiâ
PY - 2008
SP - 1
EP - 7
VL - 5
UR - http://geodesic.mathdoc.fr/item/SEMR_2008_5_a0/
LA - ru
ID - SEMR_2008_5_a0
ER -
%0 Journal Article
%A V. G. Puzarenko
%T On collection of all computable subsets on admissible sets
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2008
%P 1-7
%V 5
%U http://geodesic.mathdoc.fr/item/SEMR_2008_5_a0/
%G ru
%F SEMR_2008_5_a0
We study the existence of computable numberings of the set of all $\Delta$-predicates over admissible sets. We construct an admissible set whose set of all $\Delta$-predicates fails to have such a numbering and give a series of examples of admissible sets in which such numberings exist.
[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