19 citations · 25 across the 2 of their papers we have counts for
2 papers
cs.CC2009★ 19 cited
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
Paola Bruscoli, Alessio Guglielmi, Tom Gundersen +1
Jeřábek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Ats…
cs.LO2003★ 6 cited
On Structuring Proof Search for First Order Linear Logic
Paola Bruscoli, Alessio Guglielmi
Full first order linear logic can be presented as an abstract logic programming language in Miller's system Forum, which yields a sensible operational interpretation in the 'proof…