Abstract

We study a hierarchy of Kalmàr elementary functions on integers based on a classification of LOOP programs of limited complexity, namely those in which the depth of nestings of LOOP commands does not exceed two. It is proved that -place functions in can be enumerated by a single function in , and that the resulting hierarchy of elementary predicates (i.e., functions with 0,1-values) is proper in that there are predicates that are not in . Along the way the rudimentary predicates of Smullyan are classified as