Advertisement

Pure Iteration and Periodicity

A Note on Some Small Sub-recursive Classes
  • Mathias Barra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5028)

Abstract

We define a hierarchy Open image in new window of small sub-recursive classes, based on the schema of pure iteration. Open image in new window 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 Open image in new window iff it is definable in Presburger Arithmetic. The concluding discussion contrasts our findings to those of Kutyłowski [12].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barra, M.: A characterisation of the relations definable in Presburger Arithmetic. In: Proceedings of TAMC 2008. LNCS, vol. 4978, pp. 258–269. Springer, Heidelberg (2008)Google Scholar
  2. 2.
    Clote, P.: Computation Models and Function Algebra. In: Handbook of Computability Theory. Elsevier, Amsterdam (1996)Google Scholar
  3. 3.
    Enderton, H.B.: A mathematical introduction to logic. Academic Press, Inc., San Diego (1972)zbMATHGoogle Scholar
  4. 4.
    Grzegorczyk, A.: Some classes of recursive functions, in Rozprawy Matematyczne, No. IV, Warszawa (1953)Google Scholar
  5. 5.
    Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. In: Theoretical Computer Science, vol. 228, pp. 151–174 (1999)Google Scholar
  6. 6.
    Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming 11, 55–94 (2001)zbMATHCrossRefGoogle Scholar
  7. 7.
    Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity 14(1), 72–88 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kristiansen, L., Barra, M.: The small Grzegorczyk classes and the typed λ-calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 252–262. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Kristiansen, L., Voda, P.J.: The surprising power of restricted programs and Gödel’s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 345–358. Springer, Heidelberg (2003)Google Scholar
  10. 10.
    Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Kristiansen, L., Voda, P.J.: The Structure of Detour Degrees. In: Proceedings of TAMC 2008. LNCS, vol. 4978, pp. 148–159. Springer, Heidelberg (2008)Google Scholar
  12. 12.
    Kutyłowski, M.: Small Grzegorczyk classes. J. London Math. Soc (2) 36, 193–210 (1987)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Rose, H.E.: Subrecursion. Functions and hierarchies. Clarendon Press, Oxford (1984)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mathias Barra
    • 1
  1. 1.Dept. of MathematicsUniversity of OsloOsloNorway

Personalised recommendations