The complexity of propositional proofs

Bulletin of Symbolic Logic 13 (4):417-481 (2007)

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

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-02-05

Downloads
54 (#214,232)

6 months
2 (#257,917)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Similar books and articles