Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
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_ | 1866908627268272128 |
|---|---|
| author | Afshari, Bahareh Kloibhofer, Johannes |
| author_facet | Afshari, Bahareh Kloibhofer, Johannes |
| contents | We consider modal logic extended with the well-known temporal operator 'eventually' and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment. The work showcases an adaptation of the reductive cut-elimination method to cyclic calculi. Notably, the proposed algorithm applies to a cyclic proof and directly outputs a cyclic cut-free proof without appealing to intermediate machinery for regularising the end proof. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01935 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic Afshari, Bahareh Kloibhofer, Johannes Logic in Computer Science Logic We consider modal logic extended with the well-known temporal operator 'eventually' and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment. The work showcases an adaptation of the reductive cut-elimination method to cyclic calculi. Notably, the proposed algorithm applies to a cyclic proof and directly outputs a cyclic cut-free proof without appealing to intermediate machinery for regularising the end proof. |
| title | Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2405.01935 |