Geodesic
Table approximations to recursive predicates
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 131-135

Voir la notice de l'article provenant de la source Math-Net.Ru

The note deals with the complexity of the table approximations to the recursive predicates. In particular it is shown, that any table approximation to given recursive predicate may be essentially improved in infinitely many points. 
@article{ZNSL_1974_40_a15,
     author = {R. I. Freidson},
     title = {Table approximations to recursive predicates},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {131--135},
     publisher = {mathdoc},
     volume = {40},
     year = {1974},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a15/}
}
TY  - JOUR
AU  - R. I. Freidson
TI  - Table approximations to recursive predicates
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1974
SP  - 131
EP  - 135
VL  - 40
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a15/
LA  - ru
ID  - ZNSL_1974_40_a15
ER  - 
%0 Journal Article
%A R. I. Freidson
%T Table approximations to recursive predicates
%J Zapiski Nauchnykh Seminarov POMI
%D 1974
%P 131-135
%V 40
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a15/
%G ru
%F ZNSL_1974_40_a15
R. I. Freidson. Table approximations to recursive predicates. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 131-135. http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a15/