scientific article; zbMATH DE number 2110622
From MaRDI portal
Publication:4823142
zbMath1057.03048MaRDI QIDQ4823142
G. E. Ostrin, Stanley S. Wainer
Publication date: 26 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycut eliminationlogical complexityprovably recursive functionsordinal boundsequation calculusweak theory of arithmetic
Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity of proofs (03F20)
Related Items