The Complexity of Propositional Proofs

IF 0.7 3区数学 Q1 LOGIC

Bulletin of Symbolic Logic Pub Date : 2007-12-01 DOI:10.2178/bsl/1203350879

Nathan Segerlind

引用次数: 79

Abstract

Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.

查看原文本刊更多论文

命题证明的复杂性

命题证明复杂性是研究命题证明的大小，更一般地说，是证明命题重言式所需的资源。关于证明大小的问题与计算复杂性、算术理论和可满足性算法有关。这篇文章包括对该领域的广泛调查，以及对一些最近开发的证明大小下界的技术的技术说明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Bulletin of Symbolic Logic 数学-数学

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.