Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
Je\v{r}\'abek 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 Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a correspondence between that system and cut-free d...
Bewaard in:
| Hoofdauteurs: | , , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Logical Methods in Computer Science e.V.
2016-05-01
|
| Reeks: | Logical Methods in Computer Science |
| Onderwerpen: | |
| Online toegang: | https://lmcs.episciences.org/1637/pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|