Bounded arithmetic, proof complexity and two papers of Parikh

被引：2
|
作者：
Buss, SR [1 ]
机构：
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
来源：
ANNALS OF PURE AND APPLIED LOGIC | 1999年 / 96卷 / 1-3期
基金：
美国国家科学基金会;
关键词：
feasibility; exponentiation; bounded arithmetic; proof length; proof complexity; unification;
D O I：
10.1016/S0168-0072(98)00030-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：43 / 55
页数：13
相关论文
共 50 条
12345