Nested Sequents for Quasi-transitive Modal Logics
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917693073915904 |
|---|---|
| author | Marin, Sonia Padhiar, Paaras |
| author_facet | Marin, Sonia Padhiar, Paaras |
| contents | Previous works by Goré, Postniece and Tiu have provided sound and cut-free complete proof systems for modal logics extended with path axioms using the formalism of nested sequent. Our aim is to provide (i) a constructive cut-elimination procedure and (ii) alternative modular formulations for these systems. We present our methodology to achieve these two goals on a subclass of path axioms, namely quasi-transitivity axioms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09300 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Nested Sequents for Quasi-transitive Modal Logics Marin, Sonia Padhiar, Paaras Logic in Computer Science Logic Previous works by Goré, Postniece and Tiu have provided sound and cut-free complete proof systems for modal logics extended with path axioms using the formalism of nested sequent. Our aim is to provide (i) a constructive cut-elimination procedure and (ii) alternative modular formulations for these systems. We present our methodology to achieve these two goals on a subclass of path axioms, namely quasi-transitivity axioms. |
| title | Nested Sequents for Quasi-transitive Modal Logics |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2406.09300 |