English

Turing-Taylor expansions for arithmetic theories

Logic 2015-08-04 v2

Abstract

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on nn-provability give rise to a Πn+1\Pi_{n+1} proof-theoretic ordinal. As such, to each theory UU we can assign the sequence of corresponding Πn+1\Pi_{n+1} ordinals Unn>0\langle |U|_n\rangle_{n>0}. We call this sequence a \emph{Turing-Taylor expansion} 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 GLPω{\mathbf{GLP}}_\omega. In particular, in this first draft 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 expression will define a unique point in Ignatiev's model.

Keywords

Cite

@article{arxiv.1404.4483,
  title  = {Turing-Taylor expansions for arithmetic theories},
  author = {Joost J. Joosten},
  journal= {arXiv preprint arXiv:1404.4483},
  year   = {2015}
}

Comments

First draft

R2 v1 2026-06-22T03:52:54.642Z