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

Full description

Bibliographic Details

Published in:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 657 - 666
Main Authors:	Baaz, Matthias, Leitsch, Alexander, Reis, Giselle
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2015
Subjects:	Calculus classical logic complexity Complexity theory Computer science Context Geometry Glivenko's theorem intuitionistic logic Merging
ISSN:	1043-6871
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!