The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic | Journal of Philosophical Logic Skip to main content
Springer Nature Link
Log in

The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

References

  1. S. N. Artyomov, ‘Arithmetically complete modal theories’, (Russian), Semiotics and Information Science, No. 14 (Russian) (1980), pp. 115–133, Akad. Nauk SSSR, Vsesojuz. Inst. Nau<cn. i. Tehn. Informacii, Moscow.

    Google Scholar 

  2. G. Boolos, The Unprovability of Consistency, Cambridge University Press (1979).

  3. G. Boolos, ‘Extremely undecidable sentences’, JSL 47 (1982), 191–196.

    Google Scholar 

  4. F. Montagna, ‘On the diagonabizable algebra of Peano Arithmetic’, Bollettino Unione Matematica Italiana (5) 16B (1979), 795–812.

    Google Scholar 

  5. F. Montagna, ‘Relatively precomplete numerations and arithmetic’, Journal of Philosophical Logic 11, No. 4 (1982) 419–430.

    Google Scholar 

  6. C. Smoryński, ‘Calculating self-referential statements’, Fund. Math. 109 (1980), 189–210.

    Google Scholar 

  7. R. M. Solovay, ‘Provability interpretations of modal logic’, Israel J. Math. 25 (1976), 287–304.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, University of Utrecht, Utrecht, The Netherlands

    Albert Visser

Authors
  1. Albert Visser
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Visser, A. The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic. J Philos Logic 13, 97–113 (1984). https://doi.org/10.1007/BF00297579

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00297579

Keywords

Search

Navigation