Skip to main content
SpringerLink
Log in

The hierarchy of terminating recursive programs over N

  • Conference paper
  • First Online:
Logic and Computational Complexity (LCC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 960))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. M.V. Fairtlough, Ordinal Complexity of Recursive Programs and their Termination Proofs, Ph.D. dissertation Leeds University, 1991.

    Google Scholar 

  4. M.V. Fairtlough and S.S. Wainer, Ordinal Complexity of Recursive Definitions, Information and Computation Vol. 99, 1992, pp 123–153.

    Article  Google Scholar 

  5. W.G. Handley and S.S. Wainer, Equational Derivation versus Computation, Annals of Pure and Applied Logic Vol. 70, 1994, pp 17–49.

    Article  Google Scholar 

  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. 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. W.W. Tait, Nested Recursion, Math. Annalen Vol. 143,1961, pp 236–250.

    Google Scholar 

  9. S.S. Wainer, Slow Growing versus Fast Growing, Journ. Symbolic Logic Vol. 54, 1989, pp 608–614.

    Google Scholar 

  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. A. Weiermann, Bounding Derivation Lengths with Functions from the Slow Growing Hierarchy, preprint Univ. Münster, 1993.

    Google Scholar 

  12. A. Weiermann, Termination Proofs by Lexicographic Path Orderings yield Multiply Recursive Derivation Lengths, Theor. Computer Science, 1995, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pure Mathematics Dept., Leeds University, LS2 9JT, Leeds, UK

    Stanley S. Wainer

Authors
  1. Stanley S. Wainer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Leivant

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wainer, S.S. (1995). The hierarchy of terminating recursive programs over N. In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-60178-3_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60178-4

  • Online ISBN: 978-3-540-44720-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation