Journal of Applied and Industrial Mathematics

, Volume 4, Issue 4, pp 588–599 | Cite as

On the class of Skolem elementary functions

  • S. A. Volkov


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.


classification of recursive functions computational complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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
  3. 3.
    N. K. Kosovskii, “On the Expressive Power of the Operations of Unary Summation and Unary Bounded Multiplication,” Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 49, 3–6 (1975).MathSciNetGoogle Scholar
  4. 4.
    S. S. Marchenkov, “On Bounded Recursions,” Mathematica Balkanica 2, 124–142 (1972).MathSciNetGoogle Scholar
  5. 5.
    S. S. Marchenkov, “Elementary Skolem Functions,” Mat. Zametki 17(1), 133–141 (1975) [Math. Notes 17 (1), 79–83 (1975)].MathSciNetGoogle Scholar
  6. 6.
    S. S. Marchenkov, “A Superposition Basis in the Class of Kalmar Elementary Functions,” Mat. Zametki 27(3), 321–332 (1980) [Math. Notes 27, 161–166 (1980)].MathSciNetGoogle Scholar
  7. 7.
    S. S. Marchenkov, “Some Simple Example of Bases Under Superposition in the Class of Kalmar Elementary Functions,” Banach Center Publication, Vol. 25 (Warsaw, 1989), pp. 119–126.MathSciNetGoogle Scholar
  8. 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. 9.
    S. S. Marchenkov, Elementary Recursive Functions (MTsNMO, Moscow, 2003) [in Russian].Google Scholar
  10. 10.
    Yu. V. Matiyasevich, “Existence of Nonefficiable Estimates in the Theory of Exponentially Diophantine Equations,” Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 40, 77–93 (1974).zbMATHGoogle Scholar
  11. 11.
    Yu. V. Matiyasevich, “New Proof of the Theorem on Exponentially Diophantine Representation of Enumerable Predicates,” Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 60, 75–92 (1976).zbMATHGoogle Scholar
  12. 12.
    V. A. Nepomnyashchii, “Rudimentary Modeling of the Nondetermined Turing Calculations,” Kibernetika, No. 2, 23–29 (1973).Google Scholar
  13. 13.
    E. Allender, D. A. M. Barrington, and W. Hesse, “Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication,” J. Comp. System Sci. 65, 695–716 (2002).zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    A. Durand and M. More, “Nonerasing, Counting and Majority over the Linear Time Hierarchy,” Information and Computation 174(2), 132–142 (2002).zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    H.-A. Esbelin and M. More, “Rudimentary Relations and Primitive Recursion: A Toolbox,” Theoret. Comp. Sci. 193, 129–148 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    A. Grzegorczyk, “Some Classes of Recursive Functions,” Rozprawy Mathematyczne 4, 1–46 (1953) [in Problems of Logistics (Mir, Moscow, 1970), pp. 9–49].MathSciNetGoogle Scholar
  17. 17.
    L. Kalmar, “Egyszerü pelda eldönthetelen aritmetikai problemara,” Matematikai es fizikai lapok 50, 1–23 (1943).zbMATHMathSciNetGoogle Scholar
  18. 18.
    S. Mazzanti, “Plain Bases for Classes of Primitive Recursive Functions,” Math. Logic Quart. 48, 93–104 (2002).zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Ch. Parsons, “Hierarchies of Primitive Recursive Functions,” Zeitschr. math. Logik und Grundlag. Math. 14(4), 357–376 (1968).zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    R. W. Ritchie, “Classes of Predicably Computable Functions,” Trans. Amer. Math. Soc. 106, 139–173 (1963).zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    D. Rödding, “Über die Eliminierbarkeit von Definitionsschemata in der Theorie der rekursiven Funktionen,” Zeitschr. math. Logik und Grundlag. Math. 10(4), 315–330 (1964).zbMATHCrossRefGoogle Scholar
  22. 22.
    Th. Skolem, “A Theorem on Recursively Enumerable Sets,” in Abstracts of Short Communications. International Congress onMathematics (Stockholm, 1962), p. 11.Google Scholar
  23. 23.
    Th. Skolem, “Proof of Some Theorems on Recursively Enumerable Sets,” NotreDame J. Formal Logic 3(2), 65–74 (1962).CrossRefMathSciNetGoogle Scholar
  24. 24.
    R.M. Smullyan, Theory of Formal Systems (Princeton, 1961; Nauka, Moscow, 1981).zbMATHGoogle Scholar
  25. 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
  26. 26.
    C. Wrathall, “Rudimentary Predicates and Relative Computation,” SIAM J. Comp. 7(2), 194–209 (1978).zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • S. A. Volkov
    • 1
  1. 1.Lomonosov Moscow State UniversityVorob’evy gory, MoscowRussia

Personalised recommendations