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...
Gorde:
| Egile Nagusiak: | , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Logical Methods in Computer Science e.V.
2016-05-01
|
| Saila: | Logical Methods in Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://lmcs.episciences.org/1637/pdf |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|