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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beklemishev, L.D.: Provability algebras and proof-theoretic ordinals, I. Annals of Pure and Applied Logic 128, 103–124 (2004)
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)
Beklemishev, L.D.: Reflection principles and provability algebras in formal arithmetic. Russian Mathematical Surveys 60(2), 197–268 (2005)
Beklemishev, L.D., Fernández Duque, D., Joosten, J.J.: On transfinite provability logic (under preparation, 2012)
Solovay, R.M.: Provability interpretations of modal logic. Israel Journal of Mathematics 28, 33–71 (1976)
Turing, A.M.: Systems of logics based on ordinals. Proc. London Math. Soc. Series 2 45, 161–228 (1939)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)