On the structure of the degrees of relative provability
- 54 Downloads
We investigate the structure of the degrees of provability, which measure the proof-theoretic strength of statements asserting the totality of given computable functions. The degrees of provability can also be seen as an extension of the investigation of relative consistency statements for first-order arithmetic (which can be viewed as Π 1 0 -statements, whereas statements of totality of computable functions are Π 2 0 -statements); and the structure of the degrees of provability can be viewed as the Lindenbaum algebra of true Π 2 0 -statements in first-order arithmetic. Our work continues and greatly expands the second author’s paper on this topic by answering a number of open questions from that paper, comparing three different notions of a jump operator and studying jump inversion as well as the corresponding high/low hierarchies, investigating the structure of true Π 1 0 -statements as a substructure, and connecting the degrees of provability to escape and domination properties of computable functions.
KeywordsTuring Machine Computable Function Transition Stage Total Function Minimal Pair
Unable to display preview. Download preview PDF.