Geodesic
Decidable Computable $\mathbb A$-Numberings
Algebra i logika, Tome 41 (2002) no. 5, pp. 568-584
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The article deals in the numbering theory for admissible sets, brought in sight in [1]. For models of two special classes, we resolve the problem of there being 1-1 computable numberings of the families of all computable sets and of all computable functions. In proofs, for the former case the role of finite objects is played by syntactic constructions, and for the latter – by finite subsets on hereditarily finite superstructures.
Mots-clés : admissible set
Keywords: numbering. 
@article{AL_2002_41_5_a3,
     author = {V. G. Puzarenko},
     title = {Decidable {Computable} $\mathbb A${-Numberings}},
     journal = {Algebra i logika},
     pages = {568--584},
     year = {2002},
     volume = {41},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2002_41_5_a3/}
}
TY  - JOUR
AU  - V. G. Puzarenko
TI  - Decidable Computable $\mathbb A$-Numberings
JO  - Algebra i logika
PY  - 2002
SP  - 568
EP  - 584
VL  - 41
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/AL_2002_41_5_a3/
LA  - ru
ID  - AL_2002_41_5_a3
ER  - 
%0 Journal Article
%A V. G. Puzarenko
%T Decidable Computable $\mathbb A$-Numberings
%J Algebra i logika
%D 2002
%P 568-584
%V 41
%N 5
%U http://geodesic.mathdoc.fr/item/AL_2002_41_5_a3/
%G ru
%F AL_2002_41_5_a3
V. G. Puzarenko. Decidable Computable $\mathbb A$-Numberings. Algebra i logika, Tome 41 (2002) no. 5, pp. 568-584. http://geodesic.mathdoc.fr/item/AL_2002_41_5_a3/

[1] Yu. L. Ershov, Opredelimost i vychislimost, Nauchnaya kniga (NII MIOO NGU), Novosibirsk, 1996 | MR | Zbl

[2] V. G. Puzarenko, “O vychislimosti nad modelyami razreshimykh teorii”, Algebra i logika, 39:2 (2000), 170–197 | MR | Zbl

[3] Yu. L. Ershov, Teoriya numeratsii, Nauka, M., 1977 | MR

[4] A. I. Maltsev, Algoritmy i rekursivnye funktsii, Nauka, M., 1986 | MR