A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915348336345088 |
|---|---|
| author | Becker, Justus |
| author_facet | Becker, Justus |
| contents | We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfoundedness by using techniques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_14307 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic Becker, Justus Logic in Computer Science Logic F.4.1 We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfoundedness by using techniques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels. |
| title | A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic |
| topic | Logic in Computer Science Logic F.4.1 |
| url | https://arxiv.org/abs/2506.14307 |