Turing-Taylor expansions for arithmetic theories

DOI10.1007/S11225-016-9674-ZzbMATH Open1417.03297OpenAlexW1628975265WikidataQ120571145 ScholiaQ120571145MaRDI QIDQ514512FDOQ514512

Authors Joost J. Joosten 

Publication date 2 March 2017

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.4483

zbMATH Keywords

ordinal analysisclosed fragment of GLPconservation resultsfragments of arithmeticprovability logicsTuring progressions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

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 $P{i}_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can assign the sequence of corresponding $P{i}_{n+1}$ ordinals $langle|U{|}_{n}angl{e}_{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 ${mathbfGLP}_{o}mega$. 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.

Recommendations

• The logic of Turing progressions
• scientific article; zbMATH DE number 4061229
• Turing progressions and their well-orders
• Provability logics for natural Turing progressions of arithmetical theories
• Iterated local reflection versus iterated consistency

Cites work

• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• Hyperations, Veblen progressions and transfinite iteration of ordinal functions
• Iterated local reflection versus iterated consistency
• On provability logics with linearly ordered modalities
• On strong provability predicates and the associated modal logics
• Proof-theoretic analysis by iterated reflection
• Provability algebras and proof-theoretic ordinals. I
• Reflection principles and provability algebras in formal arithmetic
• Relational semantics for the Turing Schmerl calculus
• Solution of a problem of Leon Henkin
• Systems of Logic Based on Ordinals^†
• The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
• The omega-rule interpretation of transfinite provability logic
• Turing Jumps Through Provability
• Well-orders in the transfinite Japaridze algebra

Cited in

(9)

• Reflection calculus and conservativity spectra
• Hyperarithmetical worm battles
• Reflection algebras and conservation results for theories of iterated truth
• ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
• Conservativity spectra and Joosten-Fernández model
• Turing progressions and their well-orders
• MÜNCHHAUSEN PROVABILITY
• The logic of Turing progressions
• Relational semantics for the Turing Schmerl calculus

This page was built for publication: Turing-Taylor expansions for arithmetic theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514512)