A Note on the Complexity of Classical and Intuitionistic Proofs

DOI10.1109/LICS.2015.66zbMath1395.03027OpenAlexW2141291205MaRDI QIDQ4635844

Giselle Reis, Alexander Leitsch, Matthias Baaz

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2015.66

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

This page was built for publication: A Note on the Complexity of Classical and Intuitionistic Proofs