Inducing syntactic cut-elimination for indexed nested sequents
The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many logics of interest. The nested sequent formal...
| 主要作者: | |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Logical Methods in Computer Science e.V.
2018-11-01
|
| 丛编: | Logical Methods in Computer Science |
| 主题: | |
| 在线阅读: | https://lmcs.episciences.org/3171/pdf |