Turing Jumps Through Provability

DOI10.1007/978-3-319-20028-6_22zbMath1461.03056arXiv1501.05327OpenAlexW1923653474MaRDI QIDQ3195699

Joost J. Joosten

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (6)

On the reduction property for GLP-algebras ⋮ Reflection algebras and conservation results for theories of iterated truth ⋮ Some observations on the FGH theorem ⋮ Local reflection, definable elements and 1-provability ⋮ Turing-Taylor expansions for arithmetic theories ⋮ MÜNCHHAUSEN PROVABILITY

Cites Work

• Faith \& falsity
• The omega-rule interpretation of transfinite provability logic
• Provability algebras and proof-theoretic ordinals. I
• A criterion for completeness of degrees of unsolvability
• Degrees of unsolvability associated with classes of formalized theories

This page was built for publication: Turing Jumps Through Provability