Bounded functional interpretation and feasible analysis (Q866559): Difference between revisions

Bounded functional interpretation developed earlier by the authors [Ann. Pure Appl. Logic 135, No. 1--3, 73--112 (2005; Zbl 1095.03060)] is proved here to apply to several theories of feasible first-order arithmetic that have weak induction and polynomially computable provably recursive functions. Combining it with the variants of functional interpretation due to Cook and Urquhart, the authors obtain effective version of a conservation result over weak König's lemma.