An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Godel's T and therefore defines a non-siz...
详细信息
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Godel's T and therefore defines a non-size-increasingpolynomialtime computable function. (C) 2003 Elsevier B.V. All rights reserved.
暂无评论