Does Advice Help to Prove Propositional Tautologies?

  title={Does Advice Help to Prove Propositional Tautologies?},
  author={Olaf Beyersdorff and Sebastian M{\"u}ller},
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated by provability consequences in bounded arithmetic, Cook and Kraj́ıček [5] have recently started the… CONTINUE READING