Turing-Taylor expansions for arithmetic theories
Abstract
Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on n-provability give rise to a n+1 proof-theoretic ordinal. As such, to each theory U we can assign the sequence of corresponding n+1 ordinals |U|nn>0. We call this sequence a 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ω. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.