A Note on the Complexity of Classical and Intuitionistic Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

A Note on the Complexity of Classical and Intuitionistic Proofs

Matthias Baaz
  • Function : Author
  • PersonId : 970948
Alexander Leitsch
  • Function : Author
  • PersonId : 970949

Abstract

—We show an effective cut-free variant of Glivenko's theorem extended to formulas with weak quantifiers (those without eigenvariable conditions): " There is an elementary function f such that if ϕ is a cut-free LK proof of A with symbol complexity ≤ c, then there exists a cut-free LJ proof of ¬¬A with symbol complexity ≤ f (c) ". This follows from the more general result: " There is an elementary function f such that if ϕ is a cut-free LK proof of A with symbol complexity ≤ c, then there exists a cut-free LJ proof of A with symbol complexity ≤ f (c) ". The result is proved using a suitable variant of cut-elimination by resolution (CERES) and subsumption.
Fichier principal
Vignette du fichier
complexity.pdf (289.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01208346 , version 1 (02-10-2015)

Identifiers

Cite

Matthias Baaz, Alexander Leitsch, Giselle Reis. A Note on the Complexity of Classical and Intuitionistic Proofs. LICS 2015 - 30th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2015, Kyoto, Japan. pp.657 - 666, ⟨10.1109/LICS.2015.66⟩. ⟨hal-01208346⟩
276 View
194 Download

Altmetric

Share

Gmail Facebook X LinkedIn More