Abstract
We connect a propositional provability in models of weak arithmetics with the existence of Δb1-elementary, non-Σb1-elementary extensions. This is applied to demonstrate that certain lower bounds to the length of propositional proofs are not provable in weak systems of arithmetic (Corollary 4).
Cite
CITATION STYLE
APA
Krajíček, J., & Pudlák, P. (1990). Propositional provability and models of weak arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 440 LNCS, pp. 193–210). Springer Verlag. https://doi.org/10.1007/3-540-52753-2_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free