A computability of primitive recursive terms of finite type and the primitive recursive realization
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 32-45
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZNSL_1968_8_a4,
author = {A. G. Dragalin},
title = {A~computability of primitive recursive terms of finite type and the primitive recursive realization},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {32--45},
year = {1968},
volume = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a4/}
}
A. G. Dragalin. A computability of primitive recursive terms of finite type and the primitive recursive realization. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 32-45. http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a4/