Pure iteration and periodicity: A note on some small sub-recursive classes

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define a hierarchy of small sub-recursive classes, based on the schema of pure iteration. is compared with a similar hierarchy, based on primitive recursion, for which a collapse is equivalent to a collapse of the small Grzegorczyk-classes. Our hierarchy does collapse, and the induced relational class is shown to have a highly periodic structure; indeed a unary predicate is decidable in iff it is definable in Presburger Arithmetic. The concluding discussion contrasts our findings to those of Kutyłowski [12]. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Barra, M. (2008). Pure iteration and periodicity: A note on some small sub-recursive classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 42–51). https://doi.org/10.1007/978-3-540-69407-6_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free