Abstract

We study the question of provability of lower bounds on the complexity of explicitly given Boolean functions in weak fragments of Peano Arithmetic. To that end, we analyze what is the right fragment capturing the kind of techniques existing in Boolean complexity at present. We give both formal and informal arguments supporting the claim that a conceivable answer is V 1 (which, in view of RSUV -isomorphism, is equivalent to S 2 ), although some major results about the complexity of Boolean functions can be proved in (presumably) weaker subsystems like U 1 . As a by-product of this analysis, we give a more constructive version of the proof of Hastad Switching Lemma which probably is interesting in its own right.

Citations

262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
227	Small-bias probability spaces: Efficient constructions and applications - Naor, Naor - 1993
168	The complexity of finite functions - Boppana, Sipser - 1992
167	Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985
163	Computational Limitations for Small Depth Circuits - H˚astad - 1987
152	Natural proofs - Razborov, Rudich - 1997
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
110	Feasibly constructive proofs and the propositional calculus - Cook - 1975
106	Bounded Arithmetic. Bibliopolis - Buss - 1986
90	Metamathematics of first-order arithmetic - Hájek, Pudlák - 1993
88	Sigma 1 formulae on finite structures - Ajtai
69	Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53 - Paris, Wilkie, et al. - 1988
68	Wigderson: Monotone Circuits for Matching Require Linear Depth - Raz, A
54	The gap between monotone and nonmonotone circuit complexity is exponential - Tardos - 1988
53	A fast parallel algorithm to compute the rank of a matrix over an arbitrary field - Mulmuley - 1987
51	Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic - Razborov - 1995
29	Applications of matrix methods to the theory of lower bounds in computational complexity - Razborov - 1990
27	RSUV isomorphism - Takeuti - 1993
26	An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic - Razborov - 1993
18	Arithmetizing uniform NC - Allen - 1989
13	cek. Bounded arithmetic, Propositional logic, and Complexity theory - Kraj
9	A note on a theorem of Razborov - Barrington - 1986
6	O slo��nosti realizacii line$ino$i funkcii v klasse \Pi-shem. Matem. zametki, t - Hrapqenko - 1971
5	Ninie ocenki razmera shem ograniqenno$i glubiny v polnom bazise, soderawem funkci logiqeskogo sloeni - Razborov - 1987
4	A first-order theory for the parallel complexity class NC - Clote - 1989
4	Ob odnom metode poluqeni�� ni��nih ocenok slo��nosti \Pishem. Matem. zametki, t - Hrapqenko - 1971
3	E.: The number of two terminal series parallel networks - Riordan, Shannon - 1942
3	S i 3 and ffi V i 2 - Takeuti - 1990
3	O realizacii line$inyh funkci$i formulami v bazise - Subbotovska - 1961
2	Exponential lower bounds to the size of bounded depth frege proofs of the pigeonhole principle. Random Structures and Algorithms - icek, Woods - 1995
2	O minimal~nyh kontaktno-ventil~nyh dvuhpol snikah dl monotonnyh simmetriqeskih funkci$i - Markov - 1962
2	Ob odno$i bulevsko$i funkcii - Neqiporuk - 1966
1	Ob odnom metode poluqeni ninih ocenok slonosti individual~nyh monotonnyh funkci$i - Andreev - 1985
1	Ob odnom metode poluqeni ffffektivnyh ninih ocenok monotonno$i slonosti. Algebra i logika - Andreev - 1987
1	Ninie ocenki monotonno$i slonosti nekotoryh bulevyh funkci$i - Razborov - 1985
1	Ninie ocenki monotonno$i slonosti logiqeskogo permanenta - Razborov - 1985