Unprovability of circuit upper bounds in Cook's theory PV

Jan Krajicek, Igor C. Oliveira

We establish unconditionally that for every integer $k\ge 1$ there is a language $L \in \mbox{P}$ such that it is consistent with Cook's theory PV that $L\notin Size(n^k)$. Our…