A lower bound for intuitionistic logic

Annals of Pure and Applied Logic 146 (1):72-90 (2007)
  Copy   BIBTEX

Abstract

We give an exponential lower bound on the number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL-tautologies A1,A2,… s.t. every IL-proof of Ai must have a number of proof-lines exponential in terms of the size of Ai. We show that the results do not apply to the system of classical logic and we obtain an exponential speed-up between classical and intuitionistic logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.
A cut-elimination proof in intuitionistic predicate logic.Mirjana Borisavljević - 1999 - Annals of Pure and Applied Logic 99 (1-3):105-136.

Analytics

Added to PP
2013-12-30

Downloads
26 (#597,230)

6 months
5 (#836,975)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Proof complexity of intuitionistic implicational formulas.Emil Jeřábek - 2017 - Annals of Pure and Applied Logic 168 (1):150-190.
Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.

View all 8 citations / Add more citations