Turing–Taylor Expansions for Arithmetic Theories

Studia Logica 104 (6):1225-1243 (2016)
  Copy   BIBTEX

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 \ proof-theoretic ordinal \ also denoted \. As such, to each theory U we can assign the sequence of corresponding \ ordinals \. 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 \. 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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,824

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Logic of Turing Progressions.Eduardo Hermo Reyes & Joost J. Joosten - 2020 - Notre Dame Journal of Formal Logic 61 (1):155-180.
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
Closed fragments of provability logics of constructive theories.Albert Visser - 2008 - Journal of Symbolic Logic 73 (3):1081-1096.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
Transfinite Progressions: A Second Look At Completeness.Torkel Franzén - 2004 - Bulletin of Symbolic Logic 10 (3):367-389.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.

Analytics

Added to PP
2016-05-21

Downloads
33 (#771,415)

6 months
4 (#1,021,603)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joost Joosten
Universitat de Barcelona

Citations of this work

Münchhausen provability.Joost J. Joosten - 2021 - Journal of Symbolic Logic 86 (3):1006-1034.
On the inevitability of the consistency operator.Antonio Montalbán & James Walsh - 2019 - Journal of Symbolic Logic 84 (1):205-225.
The Logic of Turing Progressions.Eduardo Hermo Reyes & Joost J. Joosten - 2020 - Notre Dame Journal of Formal Logic 61 (1):155-180.

Add more citations

References found in this work

Solution of a problem of Leon Henkin.M. H. Löb - 1955 - Journal of Symbolic Logic 20 (2):115-118.
Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.
Provability algebras and proof-theoretic ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.

View all 10 references / Add more references