Date of Original Version

1994

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

Abstract: "In this paper we characterize the well-known computational complexity classes of the polynomial time hierarchy as classes of provably recursive functions (with graphs of suitable bounded complexity) of some second order theories with weak comprehension axiom schemas but without any induction schemas (Theorem 6). We also find a natural relationship between our theories and the theories of bounded arithmetic S[superscript i]/ (Lemmas 4 and 5). Our proofs use a technique which enables us to 'speed up' induction without increasing the bounded complexity of the induction formulas. This technique is also used to obtain an interpretability result for the theories of bounded arithmetic S[superscript i]/ (Theorem 4)."

Share

COinS