Turing–Taylor Expansions for Arithmetic Theories | Studia Logica
Skip to main content

Turing–Taylor Expansions for Arithmetic Theories

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories: iterate adding consistency of some weak base theory until you “hit” the target theory. Turing progressions based on n-consistency give rise to a \({\Pi_{n+1}}\) proof-theoretic ordinal \({|U|_{\Pi^0_{n+1}}}\) also denoted \({|U|_n}\). As such, to each theory U we can assign the sequence of corresponding \({\Pi_{n+1}}\) ordinals \({\langle |U|_n\rangle_{n > 0}}\). We call this sequence a Turing-Taylor expansion or spectrum of a theory. In this paper, we relate Turing-Taylor expansions of sub-theories of Peano Arithmetic to Ignatiev’s universal model for the closed fragment of the polymodal provability logic \({\mathsf{GLP}_\omega}\). In particular, we observe that each point in the Ignatiev model can be seen as Turing-Taylor expansions of formal mathematical theories. Moreover, each sub-theory of Peano Arithmetic that allows for a Turing-Taylor expansion will define a unique point in Ignatiev’s model.

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

Access this article

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.

Similar content being viewed by others

References

  1. Beklemishev L. D.: Iterated local reflection versus iterated consistency. Annals of Pure and Applied Logic 75, 25–48 (1995)

    Article  Google Scholar 

  2. Beklemishev L. D.: Proof-theoretic analysis by iterated reflection. Archive for Mathematical Logic 42, 515–552 (2003)

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Beklemishev, L. D., Reflection principles and provability algebras in formal arithmetic, Uspekhi Matematicheskikh Nauk 60(2):3–78, 2005. In Russian. English translation in: Russian Mathematical Surveys 60(2):197–268, 2005.

  5. Beklemishev L. D., Fernández-Duque D., Joosten J. J.: On provability logics with linearly ordered modalities, Studia Logica 102, 541–566 (2014)

    Article  Google Scholar 

  6. Beklemishev L. D., Joosten J. J., Vervoort M.: A finitary treatment of the closed fragment of Japaridze’s provability logic. Journal of Logic and Computation 15, 447–463 (2005)

    Article  Google Scholar 

  7. Fernández-Duque D., Joosten J. J.: Hyperations, Veblen progressions and transfinite iteration of ordinal functions. Annals of Pure and Applied Logic 164(7–8), 785–801 (2013)

    Article  Google Scholar 

  8. Fernández-Duque, D., J. J. Joosten, The omega-rule interpretation of transfinite provability logic (submitted). arXiv:1205.2036 [math.LO], 2013.

  9. Fernández-Duque D., Joosten J. J.: Well-orders in the transfinite Japaridze algebra. Logic Journal of the IGPL 22(6), 933–963 (2014)

    Article  Google Scholar 

  10. Hermo Reyes, E., and J. J. Joosten, Turing Schmerl logic for graded turing progressions, arXiv:1604.08705 [math.LO], 2016.

  11. Ignatiev K. N.: On strong provability predicates and the associated modal logics. The Journal of Symbolic Logic 58, 249–290 (1993)

    Article  Google Scholar 

  12. Japaridze, G., The polymodal provability logic. In Intensional logics and logical structure of theories: material from the Fourth Soviet-Finnish Symposium on Logic, Metsniereba, Telaviv, 1988. In Russian.

  13. Joosten, J. J., Interpretability Formalized. PhD thesis, Utrecht University, 2004.

  14. Joosten J. J.: The Closed Fragment of the Interpretability Logic of RCA with a constant for \({\mathrm{I}\Sigma_{1}}\). Notre Dame Journal of Formal Logic 46(2), 127–146 (2005)

    Article  Google Scholar 

  15. Joosten, J. J., Turing jumps through provability, in A. Beckmann, V. Mitrana, and M. I. Soskova (eds.), Evolving Computability—11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29–July 3, 2015 Proceedings, vol. 9136 of Lecture Notes in Computer Science, Springer, New York, 2015, pp. 216–225.

  16. Löb M. H.: Solution of a problem of Leon Henkin. Journal of Symbolic Logic 20, 115–118 (1955)

    Article  Google Scholar 

  17. Schmerl, U. R., A fine structure generated by reflection formulas over primitive recursive arithmetic. In Logic Colloquium ’78 (Mons, 1978), vol. 97 of Stud. Logic Foundations Math., North-Holland, Amsterdam, 1979, pp. 335–350.

  18. Turing A.: Systems of logics based on ordinals. Proceedings of the London Mathematical Society 45, 161–228 (1939)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joost J. Joosten.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Joosten, J.J. Turing–Taylor Expansions for Arithmetic Theories. Stud Logica 104, 1225–1243 (2016). https://doi.org/10.1007/s11225-016-9674-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-016-9674-z

Keywords