Arithmetic theories for computational complexity problems

Steve Homer, John Reif
1986 Information and Control  
This paper considers a number of arithmetic theories and shows how the strength of these theories relates to certain open problems in complexity theory concerning the polynomial-time hierarchy. These results are proved quite generally and hold for a wide class of subrecursive hierarchies. They can be used to characterize certain properties of functions provable in these theories.
doi:10.1016/s0019-9958(86)80041-9 fatcat:mp344yvwefeitja4jhkenj3n7q