Article collection "Mathematical Problems of Cybernetics" ¹16, Moscow, 2007
Authors:Volkov S.A.
An exponential expansion of the Skolem-elementary functions, and bounded superpositions of simple arithmetic functions
Abstract:
This paper describes the class of functions on natural numbers that can be obtained from some well-known functions (arithmetical and bitwise that used in programming) by superposition with the following restriction: formula may have no more than 2 floors. It’s proved that this class coincides with a modification of the class of Skolem elementary functions (also known as “lower elementary recursive functions”).