Translator Disclaimer
December 2007 The complexity of propositional proofs
Nathan Segerlind
Bull. Symbolic Logic 13(4): 417-481 (December 2007). DOI: 10.2178/bsl/1203350879

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.

Citation

Download Citation

Nathan Segerlind. "The complexity of propositional proofs." Bull. Symbolic Logic 13 (4) 417 - 481, December 2007. https://doi.org/10.2178/bsl/1203350879

Information

Published: December 2007
First available in Project Euclid: 18 February 2008

zbMATH: 1133.03037
MathSciNet: MR2369670
Digital Object Identifier: 10.2178/bsl/1203350879

Rights: Copyright © 2007 Association for Symbolic Logic

JOURNAL ARTICLE
65 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.13 • No. 4 • December 2007
Back to Top