A Note on the Complexity of Classical and Intuitionistic Proofs

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...

Celý popis

Podrobná bibliografia

Vydané v:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 657 - 666
Hlavní autori:	Baaz, Matthias, Leitsch, Alexander, Reis, Giselle
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2015
Predmet:	Calculus classical logic complexity Complexity theory Computer science Context Geometry Glivenko's theorem intuitionistic logic Merging
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!