Some simple syntactical definition of all classes of Grzegorczyk hierarchy
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 127-130
S. V. Pakhomov. Some simple syntactical definition of all classes of Grzegorczyk hierarchy. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 127-130. http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a14/
@article{ZNSL_1974_40_a14,
     author = {S. V. Pakhomov},
     title = {Some simple syntactical definition of all classes of {Grzegorczyk} hierarchy},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {127--130},
     year = {1974},
     volume = {40},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a14/}
}
TY  - JOUR
AU  - S. V. Pakhomov
TI  - Some simple syntactical definition of all classes of Grzegorczyk hierarchy
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1974
SP  - 127
EP  - 130
VL  - 40
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a14/
LA  - ru
ID  - ZNSL_1974_40_a14
ER  - 
%0 Journal Article
%A S. V. Pakhomov
%T Some simple syntactical definition of all classes of Grzegorczyk hierarchy
%J Zapiski Nauchnykh Seminarov POMI
%D 1974
%P 127-130
%V 40
%U http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a14/
%G ru
%F ZNSL_1974_40_a14

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

Let $\widetilde E^n$ be the least class of primitive recursive functions which contains initial functions of $E^n$ [1] and is closed under substitution and special recursion (see def. 5). Then $\widetilde E^n=E^n$.