An exponential lower bound for proofs in focused calculi

DOI10.1007/978-3-662-59533-6_21OpenAlexW2953194033MaRDI QIDQ2303601

Raheleh Jalali

Publication date: 4 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-662-59533-6_21

zbMATH Keywords

propositional proof complexityfeasible interpolationfocused calculisuper-intuitionistic logics

Mathematics Subject Classification ID

Logic in computer science (03B70)

This page was built for publication: An exponential lower bound for proofs in focused calculi