Turing-Taylor expansions for arithmetic theories

preprint2015arXivOpen access

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Π_{n+1} proof-theoretic ordinal. As such, to each theory UU we can assign the sequence of corresponding Πn+1Π_{n+1} ordinals ⟨∣U∣n⟩n>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}}_ω. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.