A hierarchy of primitive recursive sequence functions
RAIRO. Informatique théorique, Tome 13 (1979) no. 1, pp. 49-67. 
@article{ITA_1979__13_1_49_0,
     author = {Fachini, E. and Maggiolo-Schettini, A.},
     title = {A hierarchy of primitive recursive sequence functions},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {49--67},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {1},
     year = {1979},
     mrnumber = {525457},
     zbl = {0402.03041},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1979__13_1_49_0/}
}
TY  - JOUR
AU  - Fachini, E.
AU  - Maggiolo-Schettini, A.
TI  - A hierarchy of primitive recursive sequence functions
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 49
EP  - 67
VL  - 13
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1979__13_1_49_0/
LA  - en
ID  - ITA_1979__13_1_49_0
ER  - 
%0 Journal Article
%A Fachini, E.
%A Maggiolo-Schettini, A.
%T A hierarchy of primitive recursive sequence functions
%J RAIRO. Informatique théorique
%D 1979
%P 49-67
%V 13
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1979__13_1_49_0/
%G en
%F ITA_1979__13_1_49_0
Fachini, E.; Maggiolo-Schettini, A. A hierarchy of primitive recursive sequence functions. RAIRO. Informatique théorique, Tome 13 (1979) no. 1, pp. 49-67. http://archive.numdam.org/item/ITA_1979__13_1_49_0/

1. G. Ausiello, Complessità di calcolo delle funzioni, Boringhieri, Torino, 1975.

2. P. Axt, Iteration of Primitive Recursion, Zeisch. f. math. Logik und Grundl. d. Math., Vol. 9, 1965, pp. 253-255. | MR | Zbl

3. H. Beck, Zur Entscheidbarkeit der funktionalen Aquivalenz, Automata Theory and Formal Languages 2nd GI Conference, Lecture Notes in Computer Science, Vol. 33, 1975, pp. 127-133. | MR | Zbl

4. J. P. Cleave, A Hierarchy of Primitive Recursive Functions, Zeitsch. f. math. Logik und Grundl. d. Math., Vol. 9, 1963, pp. 331-345. | MR | Zbl

5. A. Cobham, The Intrinsic Computational Difficulty of Functions, Proc. Congress on Logic, Methodology and Philosophy of Science, Haifa, Israel, 1964, North-Holland, Amsterdam, 1964, pp. 24-30. | MR | Zbl

6. S. Eilenberg and C. C. Elgot, Iteration and Recursion, Proc. Nat.Acad. Sci.U.S.A., Vol. 61, 1968pp. 378-379. | MR | Zbl

7. S. Eilenberg and C. C. Elgot, Recursiveness, Academic Press, New York, 1970. | MR | Zbl

8. G. Germano and A. Maggiolo-Schettini, Quelques caractérisations des fonctions récursives partielles, C. R. Acad. Sc. Paris, t. 276, série A, 1973, pp. 1325-1327. | MR | Zbl

9. G. Germano and A. Maggiolo-Schettini, Sequence-to-Sequence Recursiveness, Information Processing Lett., Vol. 4, 1975, pp. 1-6. | MR | Zbl

10. G. Germano and A. Maggiolo-Schettini, Proving a Compiler Correct: a Simple Approach, J. Comput. System Sc,. Vol. 10, 1975, pp. 370-383. | MR | Zbl

11. A. Grzegorczyk, Some Classes of Recursive Functions, Rozprawy Mathematyczne, Vol. 4, 1953, pp.1-45. | MR | Zbl

12. H. Huwig and V. Claus, Das Äquivalenzproblem für spezielle Klassen von LOOP-Programmen, Theoretical Computer Science 3rd GI Conference, Lecture Notes in Computer Science, Vol. 48, 1977, pp. 73-82. | MR | Zbl

13. A. R. Meyer and D. M. Ritchie, The Complexity of LOOP Programs, Proc. 22nd A.C.M. Nat: Conference, Washington, D.C., 1968, pp. 465-469.

14. H. Müller, Characterization of the Elementary Functions in Terms of Nesting of Primitive Recursions, Recursive Function Theory Newsletters, Vol. 5, 1973.

15. R. W. Ritchie, Classes of Recursive Functions Based on Ackermann's Function, Pacific J. Math., Vol. 15, 1965, pp. 1027-1044. | MR | Zbl

16. H. Schwichtenberg, Rekursionszahlen und die Grzegorczyk Hierarchie, Arch. Math. Logik Grundlagenforsch., Vol. 12, 1969, pp. 85-97. | MR | Zbl

17. D. Tsichritzis, A note on Comparison of Subrecursive Hiérarchies, Information Processing Lett., Vol. 1, 1971, pp. 42-44. | MR | Zbl

18. D. Tsichritzis, The Equivalence Problem of Simple Programs, J. Ass. Comput. Mach, Vol. 17, 1970, pp. 729-738. | MR | Zbl