Cut-Elimination for the Bimodal Logic GR
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911688112996352 |
|---|---|
| author | Kushida, Hirohiko |
| author_facet | Kushida, Hirohiko |
| contents | In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_15732 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Cut-Elimination for the Bimodal Logic GR Kushida, Hirohiko Logic in Computer Science In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus. |
| title | Cut-Elimination for the Bimodal Logic GR |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2605.15732 |