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 -provability give rise to a proof-theoretic ordinal. As such, to each theory we can assign the sequence of corresponding ordinals . 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 . 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.
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