Title of article :
Theories with self-application and computational complexity
Author/Authors :
Thomas Strahm، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
35
From page :
263
To page :
297
Keywords :
Bounded applicative theories , Explicit mathematics , Feasible functionals , Bounded arithmetic
Journal title :
Information and Computation
Serial Year :
2003
Journal title :
Information and Computation
Record number :
262172
Link To Document :
بازگشت