Abstract
There are many classical connections between the proof-theoretic strength of systems of arithmetic and the provable totality of recursive functions. In this paper we study the provability strength of the totality of recursive functions by investigating the degree structure induced by the relative provability order of recursive algorithms. We prove several results about this proof-theoretic degree structure using recursion-theoretic techniques such as diagonalization and the Recursion Theorem.
Citation
Mingzhong Cai. "Degrees of Relative Provability." Notre Dame J. Formal Logic 53 (4) 479 - 489, 2012. https://doi.org/10.1215/00294527-1722710
Information
