journal article Mar 01, 1980

A superposition basis in the class of Kal'mar elementary functions

View at Publisher Save 10.1007/bf01140159
Topics

No keywords indexed for this article. Browse by subject →

References
8
[1]
A. Grzegorczyk, Some Classes of Recursive Functions, Rozprawy Matematyczne, IV, Warsawa (1953).
[2]
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). 10.1002/malq.19640101806
[3]
C. Parsons, ?Hierarchies of primitive recursive functions,? Z. Math. Logik Grundl. Math.,14, No. 4, 357?376 (1968). 10.1002/malq.19680142106
[4]
Yu. V. Matiyasevich, ?The diophantine representation of enumerable predicates,? Izv. Akad. Nauk SSSR, Ser. Mat.,35, No. 1, 3?30 (1971).
[5]
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).
[6]
D. A. Zakharov, Recursive Functions [in Russian], Novosibirsk State Univ. (1970).
[7]
M. Davis, H. Putnam and J. Robinson, ?The decision problem for exponential diophantine equations,? Ann. Math.,74, No. 3, 425?436 (1961). 10.2307/1970289
[8]
L. Adleman and K. Manders, ?Computational complexity of decision procedures for polynomials,? 16th Annual Symp. Found. Comput. Sci., New York, 169?177 (1975). 10.1109/sfcs.1975.9
Metrics
6
Citations
8
References
Details
Published
Mar 01, 1980
Vol/Issue
27(3)
Pages
161-166
License
View
Cite This Article
S. S. Marchenkov (1980). A superposition basis in the class of Kal'mar elementary functions. Mathematical Notes, 27(3), 161-166. https://doi.org/10.1007/bf01140159