On the class of Skolem elementary functions
- 49 Downloads
Under consideration are some equivalent definitions of the class of Skolemelementary functions (analogous to the known definitions of the class of Kalmar elementary functions) and some results for this class obtained by various mathematicians. The definitions of this class were studied independently of each other, and their equivalence is proved in this paper. The question is studied of the existence of finite superposition bases in this class. We prove that the problem of the existence of such a basis amounts to the well-known problem from the theory of computational complexity.
Keywordsclassification of recursive functions computational complexity
Unable to display preview. Download preview PDF.
- 1.S. A. Volkov, “Generating Some Classes of Recursive Functions by Superpositions of Simple Arithmetic Functions,” Dokl. Akad. Nauk, Ross. Akad. Nauk 415(4), 439–440 (2007) [Dokl. Math. 76 (1), 566–567 (2007)].Google Scholar
- 2.S. A. Volkov, “Exponential Expansion of a Class of Elementary Skolem Functions and Bounded Superpositions of Simple Arithmetic Functions,” in Mathematical Problems of Cybernetics, Vol. 16 (Fizmatlit, Moscow, 2007), pp. 163–190.Google Scholar
- 8.S. S. Marchenkov, “Bases with Respect to Superposition in the Classes of Recursive Functions,” in Mathematical Problems of Cybernetics, Vol. 3 (Nauka, Moscow, 1991), pp. 115–139.Google Scholar
- 9.S. S. Marchenkov, Elementary Recursive Functions (MTsNMO, Moscow, 2003) [in Russian].Google Scholar
- 12.V. A. Nepomnyashchii, “Rudimentary Modeling of the Nondetermined Turing Calculations,” Kibernetika, No. 2, 23–29 (1973).Google Scholar
- 22.Th. Skolem, “A Theorem on Recursively Enumerable Sets,” in Abstracts of Short Communications. International Congress onMathematics (Stockholm, 1962), p. 11.Google Scholar
- 25.S. Toda, “On the Computational Power of PP and ⊕P,” in IEEE Symposium on Foundations of Computer Science (1989), pp. 514–519.Google Scholar