On the structure of the degrees of relative provability (Q2351755)

The paper is devoted to the study of the structure of the degrees of provability. They measure the proof-theoretic strength of statements asserting the totality of given computable functions. Three jump operators are introduced and compared. The jump properties of \(\Pi_{1}^{0}\)-degrees are studied and linked to the property of escaping every provably total function. The density of the p-degrees is shown. Further the high/low hierarchy for both the hop and the jump as well as the cappable p-degrees are studied. Jump inversion for both the hop and the jump are shown and the connection between lowness and highness on the one hand and domination and escape properties of functions on the other are studied. The paper continues and expands results of the second author [Notre Dame J. Formal Logic 53, No. 4, 479--489 (2012; Zbl 1269.03043)] -- in fact a number of open questions from his earlier paper are answered.