Bounded Arithmetic and Propositional Proof Complexity

Bounded Arithmetic and Propositional Proof Complexity (1995)

Cached

Download Links

by Samuel R. Buss

Venue:	in Logic of Computation
Citations:	10 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Bounded Arithmetic and Propositional Proof Complexity	user correction - Legacy Corrections
AUTHOR NAME	Samuel R. Buss	SVM HeaderParse 0.1
AUTHOR AFFIL	Departments of Mathematics and Computer Science; University of California, San Deigo	SVM HeaderParse 0.2
AUTHOR ADDR	La Jolla, CA 92093-0112	SVM HeaderParse 0.1
ABSTRACT	This is a survey of basic facts about bounded arithmetic and about the relationships between bounded arithmetic and propositional proof complexity. We introduce the theories S 2 of bounded arithmetic and characterize their proof theoretic strength and their provably total functions in terms of the polynomial time hierarchy. We discuss other axiomatizations of bounded arithmetic, such as minimization axioms. It is shown that the bounded arithmetic hierarchy collapses if and only if bounded arithmetic proves that the polynomial hierarchy collapses. We discuss Frege and extended Frege proof length, and the two translations from bounded arithmetic proofs into propositional proofs. We present some theorems on bounding the lengths of propositional interpolants in terms of cut-free proof length and in terms of the lengths of resolution refutations. We then define the RazborovRudich notion of natural proofs of P NP and discuss Razborov's theorem that certain fragments of bounded arithmetic cannot prove superpolynomial lower bounds on circuit size, assuming a strong cryptographic conjecture. Finally, a complete presentation of a proof of the theorem of Razborov is given. 1 Review of Computational Complexity 1.1 Feasibility This article will be concerned with various "feasible" forms of computability and of provability. For something to be feasibly computable, it must be computable in practice in the real world, not merely e#ectively computable in the sense of being recursively computable.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	in Logic of Computation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	67--122	INFERENCE
CITATIONS	52 found	ParsCit 1.0