Literature cited
A. Grzegorczyk, Some Classes of Recursive Functions, Rozprawy Matematyczne, IV, Warsawa (1953).
D. Rödding “Über die Eliminierbarkeit von Definitions-schemata in der Theorie der rekursiven Funktionen,” Z. Math. Logik Grundl. Math.,10, No. 4, 315–330 (1964).
C. Parsons, “Hierarchies of primitive recursive functions,” Z. Math. Logik Grundl. Math.,14, No. 4, 357–376 (1968).
Yu. V. Matiyasevich, “The diophantine representation of enumerable predicates,” Izv. Akad. Nauk SSSR, Ser. Mat.,35, No. 1, 3–30 (1971).
Yu. V. Matiyasevich, “A class of criteria for simplicity, formulated in terms of the divisibility of binomial coefficients,” Zap. Nauch. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,67, 167–183 (1977).
D. A. Zakharov, Recursive Functions [in Russian], Novosibirsk State Univ. (1970).
M. Davis, H. Putnam and J. Robinson, “The decision problem for exponential diophantine equations,” Ann. Math.,74, No. 3, 425–436 (1961).
L. Adleman and K. Manders, “Computational complexity of decision procedures for polynomials,” 16th Annual Symp. Found. Comput. Sci., New York, 169–177 (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 27, No. 3, pp. 321–332, March, 1980.
Rights and permissions
About this article
Cite this article
Marchenkov, S.S. A superposition basis in the class of Kal'mar elementary functions. Mathematical Notes of the Academy of Sciences of the USSR 27, 161–166 (1980). https://doi.org/10.1007/BF01140159
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01140159