The hierarchy of terminating recursive programs over N

  • Stanley S. Wainer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 960)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    W. Buchholz, E.A. Cichon and A. Weiermann, A Uniform Approach to Fundamental Sequences and Subrecursive Hierarchies, Math. Logic Quarterly Vol. 40, 1994, pp 273–286.Google Scholar
  2. (2).
    E.A. Cichon, Termination Proofs and Complexity Characterizations, in Proof Theory, Eds. P. Aczel, H. Simmons, S. Wainer, Cambridge 1992, pp 173–193.Google Scholar
  3. (3).
    M.V. Fairtlough, Ordinal Complexity of Recursive Programs and their Termination Proofs, Ph.D. dissertation Leeds University, 1991.Google Scholar
  4. (4).
    M.V. Fairtlough and S.S. Wainer, Ordinal Complexity of Recursive Definitions, Information and Computation Vol. 99, 1992, pp 123–153.CrossRefGoogle Scholar
  5. (5).
    W.G. Handley and S.S. Wainer, Equational Derivation versus Computation, Annals of Pure and Applied Logic Vol. 70, 1994, pp 17–49.CrossRefGoogle Scholar
  6. (6).
    S.C. Kleene, Extension of an Effectively Generated Class of Functions by Enumeration, Colloquium Mathematicum Vol. 6, 1958, pp 67–78.Google Scholar
  7. (7).
    H. Schwichtenberg and S.S. Wainer, Ordinal Bounds for Programs, in Feasible Math. II, Eds. P. Clote, J. Remmel, Birkhäuser 1995, pp 387–406.Google Scholar
  8. (8).
    W.W. Tait, Nested Recursion, Math. Annalen Vol. 143,1961, pp 236–250.Google Scholar
  9. (9).
    S.S. Wainer, Slow Growing versus Fast Growing, Journ. Symbolic Logic Vol. 54, 1989, pp 608–614.Google Scholar
  10. (10).
    A. Weiermann, Proving Termination for Term Rewriting Systems, in Computer Science Logic, Eds. E. Börger, G. Jäger, H. Kleine-Büning, M. Richter, Springer Lect. Notes in Computer Science Vol. 626, 1991, pp 419–428.Google Scholar
  11. (11).
    A. Weiermann, Bounding Derivation Lengths with Functions from the Slow Growing Hierarchy, preprint Univ. Münster, 1993.Google Scholar
  12. (12).
    A. Weiermann, Termination Proofs by Lexicographic Path Orderings yield Multiply Recursive Derivation Lengths, Theor. Computer Science, 1995, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Stanley S. Wainer
    • 1
  1. 1.Pure Mathematics Dept.Leeds UniversityLeedsUK

Personalised recommendations