Propositional proof systems, the consistency of first order theories and the complexity of computations
Propositional proof systems, the consistency of first order theories and the complexity of computations
复制标题
DOI：
10.2307/2274765
复制
发表时间：
1989-09
影响因子：
0.6
通讯作者：
J. Krajícek;P. Pudlák
中科院分区：
文献类型：
--
作者：
J. Krajícek;P. Pudlák
本文研究了长度小于n的S中没有矛盾证明的句子的证明长度问题。我们展示了这个问题与有关命题证明系统的一些问题的关系。
Abstract We consider the problem about the length of proofs of the sentences saying that there is no proof of contradiction in S whose length is < n. We show the relation of this problem to some problems about propositional proof systems.