Geodesic
A~certain characterization of the complexity of recursive predicates
Informatics and Automation, Problems of the constructive direction in mathematics. Part 5, Tome 113 (1970), pp. 79-101.

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

@article{TRSPY_1970_113_a3,
     author = {R. I. Freidson},
     title = {A~certain characterization of the complexity of recursive predicates},
     journal = {Informatics and Automation},
     pages = {79--101},
     publisher = {mathdoc},
     volume = {113},
     year = {1970},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_1970_113_a3/}
}
TY  - JOUR
AU  - R. I. Freidson
TI  - A~certain characterization of the complexity of recursive predicates
JO  - Informatics and Automation
PY  - 1970
SP  - 79
EP  - 101
VL  - 113
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_1970_113_a3/
LA  - ru
ID  - TRSPY_1970_113_a3
ER  - 
%0 Journal Article
%A R. I. Freidson
%T A~certain characterization of the complexity of recursive predicates
%J Informatics and Automation
%D 1970
%P 79-101
%V 113
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_1970_113_a3/
%G ru
%F TRSPY_1970_113_a3
R. I. Freidson. A~certain characterization of the complexity of recursive predicates. Informatics and Automation, Problems of the constructive direction in mathematics. Part 5, Tome 113 (1970), pp. 79-101. http://geodesic.mathdoc.fr/item/TRSPY_1970_113_a3/