Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 69, Issue 2 (2004), 387-397.
We describe a general method how to construct from a propositional proof system P a possibly much stronger proof system iP. The system iP operates with exponentially long P-proofs described “implicitly” by polynomial size circuits.
As an example we prove that proof system iEF, implicit EF, corresponds to bounded arithmetic theory V12 and hence, in particular, polynomially simulates the quantified propositional calculus G and the Πb1-consequences of S12 proved with one use of exponentiation. Furthermore, the soundness of iEF is not provable in S12. An iteration of the construction yields a proof system corresponding to T2 + Exp and, in principle, to much stronger theories.
J. Symbolic Logic, Volume 69, Issue 2 (2004), 387-397.
First available in Project Euclid: 19 April 2004
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Krajíček, Jan. Implicit proofs. J. Symbolic Logic 69 (2004), no. 2, 387--397. doi:10.2178/jsl/1082418532. https://projecteuclid.org/euclid.jsl/1082418532