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...
Zapisane w:
| Główni autorzy: | , , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Logical Methods in Computer Science e.V.
2016-05-01
|
| Seria: | Logical Methods in Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://lmcs.episciences.org/1637/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|