Skip to main content
SpringerLink
Log in

On sharply bounded length induction

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1995)

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

Included in the following conference series:

Abstract

We construct models of the theory L 02 : = BASIC + Σ b0 -LIND: one where the predecessor function is not total and one not satisfying Σ 20 -PIND, showing that L 02 is strictly weaker that S 02 . The construction also shows that S 02 is not ∀∑ b0 -axiomatizable.

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. S. R. Buss. Bounded Arithmetic. Bibliopolis, Napoli, 1986.

    Google Scholar 

  2. S. R. Buss. A note on bootstrapping intuitionistic bounded arithmetic. In P. Aczel, H. Simmons, and S. S. Wainer, editors, Proof Theory, pages 149–169. Cambridge University Press, 1992.

    Google Scholar 

  3. S. R. Buss and A. Ignjatović. Unprovability of consistency statements in fragments of bounded arithmetic. Annals of Pure and Applied Logic, 74:221–244, 1995.

    Google Scholar 

  4. F. Ferreira. Some notes on subword quantification and induction thereof. Typeset Manuscript.

    Google Scholar 

  5. P. Hájek and P. Pudlák. Metamathematics of First-Order Arithmetic. Springer Verlag, Berlin, 1993.

    Google Scholar 

  6. G. Takeuti. Sharply bounded arithmetic and the function a − 1. In Logic and Computation, volume 106 of Contemporary Mathematics, pages 281–288. American Mathematical Society, Providence, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Erlangen-Nürnberg, Germany

    Jan Johannsen

Authors
  1. Jan Johannsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johannsen, J. (1996). On sharply bounded length induction. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61377-0

  • Online ISBN: 978-3-540-68507-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation