Skip to main content
SpringerLink
Log in
Book cover

Conference on Computability in Europe

CiE 2005: New Computational Paradigms pp 378–384Cite as

Complexity in Predicative Arithmetic

  • Conference paper

  • 1110 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3526))

Abstract

Complexity classes between Grzegorczyk’s E 2 and E 3 are characterized in terms of provable recursion in a theory EA(I;O) formalising basic principles of Nelson’s Predicative Arithmetic. Extensions by inductive definitions enable full arithmetic PA and higher systems to be recaptured in a setting where the natural bounding functions are “slow” rather than “fast” growing.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellantoni, S., Cook, S.: A new recursion theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Buchholz, W.: An independence result for \(\Pi^1_1\)–CA + BI. Annals of Pure and Applied Logic 23, 131–155 (1987)

    Article  MathSciNet  Google Scholar 

  3. Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)

    Google Scholar 

  4. Nelson, E.: Predicative arithmetic. Princeton (1986)

    Google Scholar 

  5. Ostrin, G.E., Wainer, S.S.: Proof theoretic complexity. In: Schwichtenberg, H., Steinbrüggen, R. (eds.) Proof and System Reliability, pp. 369–397. Kluwer, Dordrecht (2002)

    Google Scholar 

  6. Wainer, S.S., Williams, R.S.: Inductive definitions over a predicative arithmetic. Annals of Pure and Applied Logic (to appear)

    Google Scholar 

  7. Williams, R.S.: Finitely iterated inductive definitions over a predicative arithmetic, Ph.D. thesis, Leeds (2004)

    Google Scholar 

  8. Wirz, M.: Wellordering two sorts. preliminary report, Bern (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und angewandte Mathematik, Neubrückstrasse 10, CH-3012, Bern, Switzerland

    Geoffrey E. Ostrin

  2. Department of Pure Mathematics, University of Leeds, Leeds, LS2 9JT, UK

    Stan S. Wainer

Authors
  1. Geoffrey E. Ostrin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stan S. Wainer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, LS2 9JT, Leeds, U.K.

    S. Barry Cooper

  2. Department Mathematik, Universität Hamburg, Bundesstrasse 55, 20146, Hamburg, Germany

    Benedikt Löwe

  3. Universiteit van Amsterdam,  

    Leen Torenvliet

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostrin, G.E., Wainer, S.S. (2005). Complexity in Predicative Arithmetic. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_47

Download citation

  • DOI: https://doi.org/10.1007/11494645_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26179-7

  • Online ISBN: 978-3-540-32266-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation