Skip to main content

Turing Progressions and Their Well-Orders

  • Conference paper
How the World Computes (CiE 2012)

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

Included in the following conference series:

Abstract

We see how Turing progressions are closely related to the closed fragment of GLP, polymodal provability logic. Next we study natural well-orders in GLP that characterize certain aspects of these Turing progressions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beklemishev, L.D.: Provability algebras and proof-theoretic ordinals, I. Annals of Pure and Applied Logic 128, 103–124 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beklemishev, L.D.: Veblen hierarchy in the context of provability algebras. In: Proceedings of the Twelfth International Congress on Logic, Methodology and Philosophy of Science. Kings College Publications (2005)

    Google Scholar 

  3. Beklemishev, L.D.: Reflection principles and provability algebras in formal arithmetic. Russian Mathematical Surveys 60(2), 197–268 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beklemishev, L.D., Fernández Duque, D., Joosten, J.J.: On transfinite provability logic (under preparation, 2012)

    Google Scholar 

  5. Solovay, R.M.: Provability interpretations of modal logic. Israel Journal of Mathematics 28, 33–71 (1976)

    MathSciNet  Google Scholar 

  6. Turing, A.M.: Systems of logics based on ordinals. Proc. London Math. Soc. Series 2 45, 161–228 (1939)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández Duque, D., Joosten, J.J. (2012). Turing Progressions and Their Well-Orders. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30870-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30869-7

  • Online ISBN: 978-3-642-30870-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics