Bounded functional interpretation and feasible analysis (Q866559): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apal.2006.07.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135734418 / rank | |||
Normal rank | |||
Revision as of 01:24, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded functional interpretation and feasible analysis |
scientific article |
Statements
Bounded functional interpretation and feasible analysis (English)
0 references
14 February 2007
0 references
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.
0 references
functional interpretation
0 references
König's lemma
0 references
majorizability
0 references
feasibility
0 references
