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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Logical Methods in Computer Science e.V.
2016-05-01
|
| シリーズ: | Logical Methods in Computer Science |
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/1637/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|