Translator Disclaimer
June 2004 Implicit proofs
Jan Krajíček
J. Symbolic Logic 69(2): 387-397 (June 2004). DOI: 10.2178/jsl/1082418532

Abstract

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.

Citation

Download Citation

Jan Krajíček. "Implicit proofs." J. Symbolic Logic 69 (2) 387 - 397, June 2004. https://doi.org/10.2178/jsl/1082418532

Information

Published: June 2004
First available in Project Euclid: 19 April 2004

zbMATH: 1069.03053
MathSciNet: MR2058178
Digital Object Identifier: 10.2178/jsl/1082418532

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
11 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.69 • No. 2 • June 2004
Back to Top